Skip to main content
SpringerLink
Log in

Analysis of the Weil Descent Attack of Gaudry, Hess and Smart

  • Conference paper
  • First Online:
Topics in Cryptology — CT-RSA 2001 (CT-RSA 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2020))

Included in the following conference series:

Abstract

We analyze the Weil descent attack of Gaudry, Hess and Smart [11] on the elliptic curve discrete logarithm problem for elliptic curves defined over finite fields of characteristic two.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Adleman, J. DeMarrais and M. Huang, “A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields”, Algorithmic Number Theory, LNCS 877, 1994, 28–40.

    Google Scholar 

  2. D. Cantor, “Computing in the jacobian of a hyperelliptic curve”, Mathematics of Computation, 48 (1987), 95–101.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. Enge, “The extended Euclidean algorithm on polynomials, and the efficiency of hyperelliptic cryptosystems”, Designs, Codes and Cryptography, to appear.

    Google Scholar 

  4. A. Enge and P. Gaudry, “A general framework for subexponential discrete logarithm algorithms”, Rapport de Recherche Lix/RR/00/04, June 2000. Available from http://ultralix.polytechnique.fr/Labo/Pierrick.Gaudry/papers.html

  5. G. Frey, “How to disguise an elliptic curve (Weil descent) ”, Talk at ECC’ 98, Waterloo, 1998. Slides available from http://www.cacr.math.uwaterloo.ca/conferences/1998/ecc98/slides.html

  6. G. Frey, “Applications of arithmetical geometry to cryptographic constructions”, Proceedings of the Fifth International Conference on Finite Fields and Applications, to appear. Also available from http://www.exp-math.uni-essen.de/zahlentheorie/preprints/Index.html

  7. G. Frey and H. Rück, “A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves”, Mathematics of Computation, 62 (1994), 865–874.

    Google Scholar 

  8. S. Galbraith and N. Smart, “A cryptographic application of Weil descent”, Codes and Cryptography, LNCS 1746, 1999, 191–200.

    Chapter  Google Scholar 

  9. R. Gallant, R. Lambert and S. Vanstone, “Improving the parallelized Pollard lambda search on binary anomalous curves”, to appear in Mathematics of Computation.

    Google Scholar 

  10. P. Gaudry, “An algorithm for solving the discrete log problem on hyperelliptic curves”, Advances in Cryptology — Eurocrypt 2000, LNCS 1807, 2000, 19–34.

    Chapter  Google Scholar 

  11. P. Gaudry, F. Hess and N. Smart, “Constructive and destructive facets of Weil descent on elliptic curves”, preprint, January 2000. Available from http://ultralix.polytechnique.fr/Labo/Pierrick.Gaudry/papers.html

  12. Internet Engineering Task Force, The OAKLEY Key Determination Protocol, IETF RFC 2412, November 1998.

    Google Scholar 

  13. N. Koblitz, “CM-curves with good cryptographic properties”, Advances in Cryptology — Crypto’ 91, LNCS 576, 1992, 279–287.

    Chapter  Google Scholar 

  14. A. Menezes, T. Okamoto and S. Vanstone, “Reducing elliptic curve logarithms to logarithms in a finite field”, tiIEEE Transactions on Information Theory, 39 (1993), 1639–1646.

    Google Scholar 

  15. National Institute of Standards and Technology, Digital Signature Standard, FIPS Publication 186-2, February 2000.

    Google Scholar 

  16. P. van Oorschot and M. Wiener, “Parallel collision search with cryptanalytic applications”, Journal of Cryptology, 12 (1999), 1–28.

    Article  MATH  Google Scholar 

  17. S. Paulus and A. Stein, “Comparing real and imaginary arithmetics for divisor class groups of hyperelliptic curves”, Algorithmic Number Theory, LNCS 1423, 1998, 576–591.

    Chapter  Google Scholar 

  18. S. Pohlig and M. Hellman, “An improved algorithm for computing logarithms over GF(p) and its cryptographic significance”, IEEE Transactions on Information Theory, 24 (1978), 106–110.

    Article  MATH  MathSciNet  Google Scholar 

  19. J. Pollard, “Monte Carlo methods for index computation mod p”, Mathematics of Computation, 32 (1978), 918–924.

    Article  MATH  MathSciNet  Google Scholar 

  20. T. Satoh and K. Araki, “Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves”, Commentarii Mathematici Universitatis Sancti Pauli, 47 (1998), 81–92.

    MATH  MathSciNet  Google Scholar 

  21. I. Semaev, “Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p”, Mathematics of Computation, 67 (1998), 353–356.

    Article  MATH  MathSciNet  Google Scholar 

  22. N. Smart, “The discrete logarithm problem on elliptic curves of trace one”, Journal of Cryptology, 12 (1999), 193–196.

    Article  MATH  MathSciNet  Google Scholar 

  23. J. Solinas, “Eficient arithmetic on Koblitz curves”, Designs, Codes and Cryptography, 19 (2000), 195–249.

    Article  MATH  MathSciNet  Google Scholar 

  24. M. Wiener and R. Zuccherato, “Faster attacks on elliptic curve cryptosystems”, Selected Areas in Cryptography, LNCS 1556, 1999, 190–200.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Combinatorics and Optimization, University of Waterloo, Canada

    Alfred Menezes

  2. Certicom Research, Canada

    Alfred Menezes & Minghua Qu

Authors
  1. Alfred Menezes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Minghua Qu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Gemplus Card International, 34 rue Guynemer, 92447, Issy les Moulineaux, France

    David Naccache

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Heidelberg

About this paper

Cite this paper

Menezes, A., Qu, M. (1999). Analysis of the Weil Descent Attack of Gaudry, Hess and Smart. In: Naccache, D. (eds) Topics in Cryptology — CT-RSA 2001. CT-RSA 2001. Lecture Notes in Computer Science, vol 2020. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45353-9_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-45353-9_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45353-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation