Weak fields for ECC

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

Volumn 2964, Issue , 2004, Pages 366-386

  Menezes, Alfred ^a   Teske, Edlyn ^a   Weng, Annegret ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; PUBLIC KEY CRYPTOGRAPHY;

ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOGRAPHY; ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEMS; FINITE FIELDS; RHO METHODS;

GEOMETRY;

EID: 35048833769     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24660-2_28     Document Type: Conference Paper

References (45)

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.
2. P. Barrett, “Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor”, Advances in Cryptology— CRYPTO’86, LNCS 263 (1987), 311–323.
3. D. Bernstein, “Circuits for integer factorization: A proposal”, preprint, 2001.
4. D. Cantor, “Computing in the jacobian of a hyperelliptic curve”, Math. Comp., 48 (1987), 95–101.
5. D. Cantor and H. Zassenhaus, “A new algorithm for factoring polynomials over finite fields”, Math. Comp., 36 (1981), 587–592.
6. D. Coppersmith, A. Odlyzko and R. Schroeppel, “Discrete logarithms in GF(p)”, Algorithmica, 1 (1986), 1–15.
7. A. Enge and P. Gaudry, “A general framework for subexponential discrete logarithm algorithms”, Acta Arithmetica, 102 (2002), 83–103.
8. FIPS 186-2, “Digital signature standard (DSS)”, Federal Information Processing Standards Publication 186–2, National Institute of Standards and Technology, 2000.
9. R. Flassenberg and S. Paulus, “Sieving in function fields”, Experimental Mathematics, 8 (1999), 339–349.
10. M. Fouquet, “Anneau d’endomorphismes et cardinalitè des courbes elliptiques: aspects algorithmiques”, PhD thesis, Ecole polytechnique, Palaiseau Cedex, 2001.
11. G. Frey, “Applications of arithmetical geometry to cryptographic constructions”, Proceedings of the Fifth International Conference on Finite Fields and Applications, Springer-Verlag, 2001, 128–161.
12. G. Frey and 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.
13. S. Galbraith, “Constructing isogenies between elliptic curves over finite fields”, LMS Journal of Computation and Mathematics, 2 (1999), 118-138.
14. S. Galbraith, “Weil descent of jacobians”, Discrete Applied Mathematics, 12 (2003), 165–180.
15. S. Galbraith, F. Hess and N. Smart, “Extending the GHS Weil descent attack”, Advances in Cryptology—EUROCRYPT 2002, LNCS 2332 (2002), 29–44.
16. R. Gallant, R. Lambert and S. Vanstone, “Improving the parallelized Pollard lambda search on anomalous binary curves”, Math. Comp., 69 (2000), 1699–1705.
17. P. Gaudry, “An algorithm for solving the discrete log problem in hyperelliptic curves”, Advances in Cryptology—EUROCRYPT 2000, LNCS 1807 (2000), 19–34.
18. P. Gaudry, F. Hess and N. Smart, “Constructive and destructive facets of Weil descent on elliptic curves”, J. Cryptology, 15 (2002), 19–46.
19. D. Hankerson, personal communication, 2003.
20. F. Hess, “The GHS attack revisited”, Advances in Cryptology—EUROCRYPT 2003, LNCS 2656 (2003), 374–387.
21. F. Hess, personal communication, 2003.
22. M. Jacobson, personal communication, 2003.
23. M. Jacobson, A. Menezes and A. Stein, “Solving elliptic curve discrete logarithm problems using Weil descent”, Journal of the Ramanujan Mathematical Society, 16 (2001), 231–260.
24. M. Jacobson and A. van der Poorten, “Computational aspects of NUCOMP”, Algorithmic Number Theory—ANTS-IV, LNCS 2369 (2002), 120–133.
25. D. Kohel, “Endomorphism rings of elliptic curves over finite fields”, PhD thesis, University of California, Berkeley, 1996.
26. F. Kuhn and R. Struik, “Random walks revisited: Extensions of Pollard’s rho algorithm for computing multiple discrete logarithms”, Selected Areas in Cryptography—SAC 2001, LNCS 2259 (2001), 212–229.
27. J. Lòpez and R. Dahab, “High-speed software multiplication in F2m”, Progress in Cryptology—INDOCRYPT 2000, LNCS 1977 (2000), 203–212.
28. M. Maurer, A. Menezes and E. Teske, “Analysis of the GHS Weil descent attack on the ECDLP over characteristic two finite fields of composite degree”, LMS Journal of Computation and Mathematics, 5 (2002), 127–174.
29. A. Menezes, T. Okamoto and S. Vanstone, “Reducing elliptic curve logarithms to logarithms in a finite field”, IEEE Transactions on Information Theory, 39 (1993), 1639–1646.
30. A. Menezes and M. Qu, “Analysis of the Weil descent attack of Gaudry, Hess and Smart”, Topics in Cryptology—CT-RSA 2001, LNCS 2020 (2001), 308–318.
31. P. van Oorschot and M. Wiener, “Parallel collision search with cryptanalytic applications”, J. Cryptology, 12 (1999), 1–28.
32. H. Orman, “The OAKLEY key determination protocol”, RFC 2412, 1998. Available from http://www.ietf.org.
33. S. Paulus and A. Stein, “Comparing real and imaginary arithmetics for divisor class groups of hyperelliptic curves”, Algorithmic Number Theory—ANTS-III, LNCS 1423 (1998), 576–591.
34. J. Pollard, “Monte Carlo methods for index computation mod p”, Math. Comp., 32 (1978), 918–924.
35. 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.
36. I. Semaev, “Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p”, Math. Comp., 67 (1998), 353–356.
37. V. Shoup, NTL: A library for doing Number Theory. Available from http://shoup.net/ntl.
38. N. Smart, “The discrete logarithm problem on elliptic curves of trace one”, J. Cryptology, 12 (1999), 193–196.
39. N. Smart, “How secure are elliptic curves over composite extension fields?”, Advances in Cryptology—Eurocrypt 2001, LNCS 2045 (2001), 30–39.
40. J. Solinas, “Efficient arithmetic on Koblitz curves”, Designs, Codes and Cryptography, 19 (2000), 195–249.
41. E. Teske, “Speeding up Pollard’s rho method for computing discrete logarithms”, Algorithmic Number Theory, LNCS 1423 (1998), 541–554.
42. E. Teske, “On random walks for Pollard’s rho method”, Math. Comp., 70 (2000), 809–825.
43. E. Teske, “An elliptic curve trapdoor system”, Cryptology ePrint Archive Report 2003/058, 2003.
44. M. Wiener, “The full cost of cryptanalytic attacks”, J. Cryptology, to appear.
45. M. Wiener and R. Zuccherato, “Faster attacks on elliptic curve cryptosystems”, Selected Areas in Cryptography—SAC’98, LNCS 1556 (1999), 190–200.