Analysis of the GHS weil descent attack on the ECDLP over characteristic two finite fields of composite degree

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2247, Issue , 2001, Pages 195-213

  Maurer, Markus ^a   Menezes, Alfred ^a   Teske, Edlyn ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY;

ELLIPTIC CURVE; ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEMS; FINITE FIELDS; GHS WEIL DESCENT ATTACK; WEIL DESCENTS;

CRYPTOGRAPHY;

EID: 84974693377     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45311-3_19     Document Type: Conference Paper

References (24)

1. E. Artin. "Quadratische Körper im Gebiete der höheren Kongruenzen", Mathematische Zeitschrift, 19 (1924), 207-246.
2. D. Cantor, "Computing in the jacobian of a hyperelliptic curve", Math. Comp., 48 (1987), 95-101.
3. M. Daberkow, C. Fieker, J. Klüners, M. Pohst, K. Roegner, M. Schörnig, K. Wildanger, "KANT V4", J. Symbolic Computation, 24 (1997), 267-283.
4. A. Enge, P. Gaudry, "A general framework for subexponential discrete logarithm algorithms", Acta Arithmetica, to appear.
5. M. Fouquet, P. Gaudry, R. Harley, "An extension of Satoh’s algorithm and its implementation", J. Ramanujan Mathematical Society, 15 (2000), 281-318.
6. G. Frey, "How to disguise an elliptic curve (Weil descent)", Talk at ECC '98, Waterloo, 1998.
7. G. Frey, H. Rück, "A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves", Math. Comp., 62 (1994), 865-874.
8. S. Galbraith, F. Hess, N. Smart, "Extending the GHS Weil descent attack", preprint, 2001.
9. S. Galbraith, N. Smart, "A cryptographic application of Weil descent", Codes and Cryptography, LNCS 1746, 1999, 191-200.
10. P. Gaudry, "An algorithm for solving the discrete log problem on hyperelliptic curves", Advances in Cryptology-Eurocrypt 2000, LNCS 1807, 2000, 19-34.
11. P. Gaudry, F. Hess, N. Smart, "Constructive and destructive facets of Weil descent on elliptic curves", preprint, January 2000.
12. F. Hess, KASH program for performing the GHS attack, 2000.
13. Internet Engineering Task Force, The OAKLEY Key Determination Protocol, IETF RFC 2412, November 1998.
14. M. Jacobson, A. Menezes, A. Stein, "Solving elliptic curve discrete logarithm problems using Weil descent", J. Ramanujan Mathematical Society, to appear.
15. A. Joux. Personal communication. June 2001.
16. A. Joux, R. Lercier, "Improvements on the general number field sieve for discrete logarithms in finite fields", Math. Comp., to appear.
17. A. Menezes, T. Okamoto, S. Vanstone, "Reducing elliptic curve logarithms to logarithms in a finite field", IEEE Trans. Info. Th., 39 (1993), 1639-1646.
18. A. Menezes, M. Qu, "Analysis of the Weil descent attack of Gaudry, Hess and Smart", Topics in Cryptology-CT-RSA 2001, LNCS 2020, 2001, 308-318.
19. P. van Oorschot, M. Wiener, "Parallel collision search with cryptanalytic applications", J. Cryptology, 12 (1999), 1-28.
20. S. Paulus, H. Rück, "Real amd imaginary quadratic representations of hyperelliptic function fields", Math. Comp., 68 (1999), 1233-1241.
21. S. Pohlig, M. Hellman, "An improved algorithm for computing logs over GF(p) and its cryptographic significance", IEEE Trans. Info. Th., 24 (1978), 106-110.
22. J. Pollard, "Monte Carlo methods for index computation mod p", Math. Comp., 32 (1978), 918-924.
23. T. Satoh, "The canonical lift of an ordinary elliptic curve over a finite field and its point counting", J. Ramanujan Mathematical Society, 15 (2000), 247-270.
24. E. Teske, "Speeding up Pollard’s rho method for computing discrete logarithms", Algorithmic Number Theory, LNCS 1423, 1998, 541-554.