Skip to main content
Springer Nature Link
Log in

The Equivalence Between the DHP and DLP for Elliptic Curves Used in Practical Applications, Revisited

  • Conference paper
Cryptography and Coding (Cryptography and Coding 2005)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 3796))

Included in the following conference series:

Abstract

The theoretical equivalence between the DLP and DHP problems was shown by Maurer in 1994. His work was then reexamined by Muzereau et al. [12] for the special case of elliptic curves used in practical cryptographic applications. This paper improves on the latter and tries to get the tightest possible reduction in terms of computational equivalence, using Maurer’s method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. ANSI. X9.62 – Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA) (1999)

    Google Scholar 

  2. Bentahar, K.: The Equivalence Between the DHP and DLP for Elliptic Curves Used in Practical Applications, Revisited. Cryptology ePrint Archive, Report 2005/307 (2005), http://eprint.iacr.org/

  3. Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic curves in cryptography. Cambridge University Press, Cambridge (1999)

    MATH  Google Scholar 

  4. Cohen, H.: A Course In Computational Algebraic Number Theory. GTM, p. 138. Springer, Heidelberg (1993)

    MATH  Google Scholar 

  5. Hankerson, D., Menezes, A., Vanstone, S.: Guide to elliptic curve cryptography. Springer, Heidelberg (2003)

    Google Scholar 

  6. Knuth, D.E.: The art of computer programming, vol. 2. Addison-Wesley Longman, Amsterdam (1998)

    Google Scholar 

  7. Maurer, U.M.: Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 271–281. Springer, Heidelberg (1994)

    Google Scholar 

  8. Maurer, U.M., Wolf, S.: On the difficulty of breaking the DH protocol. Technical Report #24, Department of Computer Science, ETH Zurich (1996)

    Google Scholar 

  9. Maurer, U.M., Wolf, S.: Diffie-Hellman Oracles. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 268–282. Springer, Heidelberg (1996)

    Google Scholar 

  10. Maurer, U.M., Wolf, S.: The relationship between breaking the Diffie-Hellman protocol and computing discrete logarithms. SIAM Journal on Computing 28, 1689–1721 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  11. Maurer, U.M., Wolf, S.: The Diffie-Hellman protocol. Designs, Codes, and Cryptography 19, 147–171 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  12. Muzereau, A., Smart, N.P., Vrecauteren, F.: The equivalence between the DHP and DLP for elliptic curves used in practical applications. LMS J. Comput. Math. 7, 50–72 (2004)

    MATH  MathSciNet  Google Scholar 

  13. NIST. FIPS 186.2 Digital Signature Standard, DSS (2000)

    Google Scholar 

  14. PARI/GP, version 2.1.3, Bordeaux (2000), http://pari.math.u-bordeaux.fr/

  15. Rück, H.-G.: A note on elliptic curves over finite fields. Math. Comp. 49, 301–304 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  16. Schoof, R.: Elliptic curves over finite fields and the computation of square roots p. Math. Comp. 44, 483–494 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  17. SECG. SEC2: Recommended Elliptic Curve Domain Parameters (2000), See http://www.secg.org/

  18. Waterhouse, W.C.: Abelian varieties over finite fields. Ann. Sci. École Norm. Sup. 2, 521–560 (1969)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB, United Kingdom

    K. Bentahar

Authors
  1. K. Bentahar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. Computer Science, University of Bristol, Woodland Road, BS8 1UB, Bristol, United Kingdom

    Nigel P. Smart

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bentahar, K. (2005). The Equivalence Between the DHP and DLP for Elliptic Curves Used in Practical Applications, Revisited. In: Smart, N.P. (eds) Cryptography and Coding. Cryptography and Coding 2005. Lecture Notes in Computer Science, vol 3796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11586821_25

Download citation

  • DOI: https://doi.org/10.1007/11586821_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30276-6

  • Online ISBN: 978-3-540-32418-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics