10 search results - page 2 / 2 » A Subexponential Algorithm for Discrete Logarithms over All ... |
EUROCRYPT
2000
Springer
13 years 9 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...
INDOCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
In this paper, the authors analyze the Gaudry–Hess–Smart (GHS) Weil descent attack on the elliptic curve discrete logarithm problem (ECDLP) for elliptic curves defined over c...
ASIACRYPT
2000
Springer
13 years 9 months ago
2000
Springer
The paper shows that some of elliptic curves over finite fields of characteristic three of composite degree are attacked by a more effective algorithm than Pollard’s ρ method...
EUROCRYPT
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
CHES
2008
Springer
13 years 7 months ago
2008
Springer
Elliptic Curve Cryptosystems (ECC) have gained increasing acceptance in practice due to their significantly smaller bit size of the operands compared to other public-key cryptosyst...