论文信息 - The equivalence between the DHP and DLP for elliptic curves used in practical applications

The equivalence between the DHP and DLP for elliptic curves used in practical applications

We re-examine the reduction of Maurer and Wolf of the Discrete Logarithm problem to the Diffie–Hellman problem. We give a precise estimate for the number of operations required in the reduction and use this to estimate the exact security of the elliptic curve variant of the Diffie–Hellman protocol for various elliptic curves defined in standards.

N. Smart | F. Vercauteren | Antoine Muzereau

[1] S. Lang,et al. Abelian varieties over finite fields , 2005 .

[2] R. Schoof. Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p , 1985 .

[3] Michael Rosen. Abelian Varieties over ℂ , 1986 .

[4] J. Voloch. A note on elliptic curves over finite fields , 1988 .

[5] Henri Cohen,et al. A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[6] Ueli Maurer,et al. Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms , 1994, CRYPTO.

[7] Ueli Maurer,et al. Diffie-Hellman Oracles , 1996, CRYPTO.

[8] Ueli Maurer,et al. The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms , 1999, SIAM J. Comput..

[9] Ian F. Blake,et al. Elliptic curves in cryptography , 1999 .

[10] Ueli Maurer,et al. The Diffie–Hellman Protocol , 2000, Des. Codes Cryptogr..

[11] Alfred Menezes,et al. The Elliptic Curve Digital Signature Algorithm (ECDSA) , 2001, International Journal of Information Security.