147 search results - page 4 / 30 » Logarithmic keying |
CANS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. We extend their setting to the ring of integers modulo N. W...
FOCS
2000
IEEE
14 years 29 days ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
IIWAS
2004
13 years 10 months ago
2004
Group signature schemes permit a group member signing on messages anonymously and unlinkably on behalf of a group. The anonymity can be revoked when arguments occurred. This paper...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
The paper analyzes CFVZ, a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve. It is shown that the co...
DCC
2001
IEEE
14 years 8 months ago
2001
IEEE
We describe several cryptographic schemes in quadratic function fields of odd characteristic. In both the real and the imaginary representation of such a field, we present a Diffi...