56 search results - page 5 / 12 » An Efficient Group Signature Based on the Discrete Logarithm... |
100
click to vote
EUROCRYPT
2000
Springer
15 years 3 months ago
2000
Springer
We present an index-calculus algorithm for the computation of discrete logarithms in the Jacobian of hyperelliptic curves defined over finite fields. The complexity predicts that i...
112
click to vote
ASIACRYPT
2001
Springer
15 years 3 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
119
Voted
INDOCRYPT
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. For elliptic curve based cryptosystems, the discrete logarithm problem must be hard to solve. But even when this is true from a mathematical point of view, side-channel a...
CORR
2006
Springer
14 years 11 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...
97
Voted
SETA
2004
Springer
15 years 5 months ago
2004
Springer
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...