Speeding up the discrete log computation on curves with automorphisms

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

Volumn 1716, Issue , 1999, Pages 103-121

  Duursma, I ^a   Gaudry, P ^b   Morain, F ^b  

^a UNIVERSITY OF LIMOGES   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Automorphisms; Discrete logarithm; Elliptic and hyperelliptic curves

Indexed keywords

CRYPTOGRAPHY; GEOMETRY; SECURITY OF DATA;

AUTOMORPHISMS; DISCRETE LOGARITHMS; ELLIPTIC CURVE; HYPER-ELLIPTIC CURVES; SPEED UP;

COMPUTATION THEORY;

EID: 84956867482     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48000-6_10     Document Type: Conference Paper

References (52)

1. R. D. Accola. Two theorems on Riemann surfaces with noncyclic automorphism groups. Proc. Amer. Math. Soc., 25:598–602, 1970.
2. L. M. Adleman, J. DeMarrais, and M.-D. Huang. A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields. In L. Adleman and M.-D. Huang, editors, ANTS-I, volume 877 of Lecture Notes in Comput. Sci., pages 28–40. Springer-Verlag, 1994. 1st Algorithmic Number Theory Symposium - Cornell University, May 6-9, 1994.
3. J. Buhler and N. Koblitz. Lattice basis reduction, Jacobi sums and hyperellitic cryptosystems. Bull. Austral. Math. Soc., 58:147–154, 1998.
4. D. G. Cantor. Computing in the Jacobian of an hyperelliptic curve. Math. Comp., 48(177):95–101, 1987.
5. J. Chao, N. Matsuda, J. Sato, and S. Tsujii. Efficient construction of secure hy-perelliptic discrete logarithm problems of large genera. In Proc. Symposium on Cryptography and Information Security, 1997. Fukuoka, Japan.
6. Y.-M. J. Chen. On the elliptic curve discrete logarithm problem. Preprint, June 1999.
7. J. H. Cheon, D. H. Lee, and S. G. Hahn. Elliptic curve discrete logarithms and Wieferich primes. Preprint, September 1998.
8. L. Comtet. Analyse combinatoire. Presses Universitaires de France, 1970.
9. p− x + 1 over a finite field of odd characteristic p. In H. Tapia-Recillas, editor, Proceedings of the”International Conference on Coding Theory, Cryptography and Related Areas”, volume yyy of Lecture Notes in Comput. Sci., 1999. Guanajuato, Mexico on April, 1998.
10. P. Flajolet and A. M. Odlyzko. Random mapping statistics. In J.-J. Quisquater, editor, Advances in Cryptology, volume 434 of Lecture Notes in Comput. Sci., pages 329–354. Springer-Verlag, 1990. Proc. Eurocrypt’89, Houthalen, April 10–13.
11. G. Frey and H.-G. Rück. A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comp., 62(206):865–874, April 1994.
12. S. D. Galbraith, S. Paulus, and N. P. Smart. Arithmetic on superelliptic curves. Preprint, 1999.
13. R. Gallant, R. Lambert, and S. Vanstone. Improving the parallelized Pollard lambda search on binary anomalous curves.
14. P. Gaudry. A variant of the Adleman-DeMarrais-Huang algorithm and its application to small genera. Research Report LIX/RR/99/04, LIX, June 1999. Available at http://www.lix.polytechnique.fr/Labo/Pierrick.Gaudry/.
15. M. J. Jacobson, N. Koblitz, J. H. Silverman, A. Stein, and E. Teske. Analysis of the Xedni calculus attack. Preprint, February 1999.
16. E. Kani and M. Rosen. Idempotent relations and factors of Jacobians. Math. Ann., 298:307–327, 1989.
17. H. J. Kim, J. Cheon, and S. Hahn. Elliptic logarithm over a finite field and the lifting to Q. Preprint, September 1998.
18. N. Koblitz. A course in number theory and cryptography, volume 114 of Graduate Texts in Mathematics. Springer–Verlag, 1987.
19. N. Koblitz. Elliptic curve cryptosystems. Math. Comp., 48(177):203–209, January 1987.
20. N. Koblitz. Hyperelliptic cryptosystems. J. of Cryptology, 1:139–150, 1989.
21. N. Koblitz. A family of jacobians suitable for discrete log cryptosystems. In S. Goldwasser, editor, Advances in Cryptology – CRYPTO’88, volume 403 of Lecture Notes in Comput. Sci., pages 94–99. Springer–Verlag, 1990. Proceedings of a conference on the theory and application of cryptography held at the University of California, Santa Barbara, August 21-25, 1988.
22. N. Koblitz. CM-curves with good cryptographic properties. In Joan Feigenbaum, editor, Advances in Cryptology – CRYPTO’91, volume 576 of Lecture Notes in Comput. Sci., pages 279–287. Springer-Verlag, 1992. Santa Barbara, August 12–15.
23. H. W. Lenstra, Jr. Factoring integers with elliptic curves. Ann. of Math. (2), 126:649–673, 1987.
24. R. Lercier. Finding good random elliptic curves for cryptosystems defined over F2n. In W. Fumy, editor, Advances in Cryptology – EUROCRYPT’97, volume 1233 of Lecture Notes in Comput. Sci., pages 379–392. Springer-Verlag, 1997. International Conference on the Theory and Application of Cryptographic Techniques, Konstanz, Germany, May 1997, Proceedings.
25. R. Lercier and F. Morain. Counting the number of points on elliptic curves over finite fields: strategies and performances. In L. C. Guillou and J.-J. Quisquater, editors, Advances in Cryptology – EUROCRYPT’95, volume 921 of Lecture Notes in Comput. Sci., pages 79–94, 1995. International Conference on the Theory and Application of Cryptographic Techniques, Saint-Malo, France, May 1995, Proceedings.
26. A. Menezes, T. Okamoto, and S. A. Vanstone. Reducing elliptic curves logarithms to logarithms in a finite field. IEEE Trans. Inform. Theory, IT–39(5):1639–1646, September 1993.
27. A. J. Menezes. Elliptic curve public key cryptosystems. Kluwer Academic Publishers, 1993.
28. V. Miller. Use of elliptic curves in cryptography. In A. M. Odlyzko, editor, Advances in Cryptology – CRYPTO’86, volume 263 of Lecture Notes in Comput. Sci., pages 417–426. Springer-Verlag, 1987. Proceedings, Santa Barbara (USA), August 11–15, 1986.
29. J. S. Milne. Jacobian varieties. In G. Cornell and J. H. Silverman, editors, Arithmetic Geometry, pages 167–212. Springer-Verlag, 1986.
30. V. M¨uller. Fast multiplication on elliptic curves over small fields of characteristic two. J. of Cryptology, 11(4):219–234, 1998.
31. D. Mumford. Tata lectures on theta II. Birkhauser, 1984.
32. S. Nakajima. p-ranks and automorphism groups of algebraic curves. Trans. Amer. Math. Soc., 303(2):595–607, October 1987.
33. S. Pohlig and M. Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inform. Theory, IT–24:106– 110, 1978.
34. J. M. Pollard. Monte Carlo methods for index computation (mod p). Math. Comp., 32(143):918–924, July 1978.
35. J.-J. Quisquater and J.-P. Delescaille. How easy is collision search? application to DES. In J.-J. Quisquater, editor, Advances in Cryptology, volume 434 of Lecture Notes in Comput. Sci., pages 429–434. Springer-Verlag, 1990. Proc. Eurocrypt’89, Houthalen, April 10–13.
36. P. Roquette. Abschätzung der Automorphismenanzahl von Funktionenkörpern bei Primzahlcharakteristik. Math. Z., 117:157–163, 1970.
37. Y. Sakai and K. Sakurai. Design of hyperelliptic cryptosystems in small charatc-teristic and a software implementation over T'2n. In K. Ohta and D. Pei, editors, Advances in Cryptology, volume 1514 of Lecture Notes in Comput. Sci., pages 80– 94. Springer-Verlag, 1998. Proc. Asiacrypt’98, Beijing, October, 1998.
38. T. Satoh and K. Araki. Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves. Comment. Math. Helv., 47(1):81–92, 1998.
39. J. Sattler and C. P. Schnorr. Generating random walks in groups. Ann. Univ. Sci. Budapest. Sect. Comput., 6:65–79, 1985.
40. I. A. Semaev. Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curves in characteristic p. Math. Comp., 67(221):353–356, January 1998.
41. D. Shanks. Class number, a theory of factorization, and genera. In Proc. Symp. Pure Math. vol. 20, pages 415–440. AMS, 1971.
42. J. H. Silverman. Advanced Topics in the Arithmetic of Elliptic Curves, volume 151 of Grad. Texts in Math. Springer-Verlag, 1994.
43. J. H. Silverman. The XEDNI calculus and the elliptic curve discrete logarithm problem. Preprint, August 1998.
44. N. Smart. The discrete logarithm problem on elliptic curves of trace one. Preprint HP-LABS Technical Report (Number HPL-97-128). To appear in J. Cryptology, 1997.
45. N. P. Smart. Elliptic curve cryptosystems over small fields of odd characteristic. J. of Cryptology, 12(2):141–151, 1999.
46. A.-M. Spallek. Kurven vom Geschlecht 2 und ihre Anwendung in Public-Key-Kryptosystemen. PhD thesis, Universität Gesamthochschule Essen, July 1994.
47. A. Stein and E. Teske. Catching kangaroos in function fields. Preprint, March 1999.
48. ¨Uber die Automorphismengruppe eines algebraischen Funktio-nenkörpers von Primzahlcharakteristik. I. Eine Abschätzung der Ordnung der Au-tomorphismengruppe. Arch. Math. (Basel), 24:527–544, 1973.
49. E. Teske. Speeding up Pollard’s rho method for computing discrete logarithms. In J. P. Buhler, editor, Algorithmic Number Theory, volume 1423 of Lecture Notes in Comput. Sci., pages 541–554. Springer-Verlag, 1998. Third International Symposium, ANTS-III, Portland, Oregon, june 1998, Proceedings. 106
50. P. C. van Oorschot and M. J. Wiener. Parallel collision search with cryptanalytic applications. J. of Cryptology, 12:1–28, 1999.
51. P. van Wamelen. Examples of genus two CM curves defined over the rationals. Math. Comp., 68(225):307–320, January 1999.
52. M. J. Wiener and R. J. Zuccherato. Faster attacks on elliptic curve cryptosys-tems. In S. Tavares and H. Meijer, editors, Selected Areas in Cryptography’98, volume 1556 of Lecture Notes in Comput. Sci. Springer-Verlag, 1999. 5th Annual International Workshop, SAC’98, Kingston, Ontario, Canada, August 17-18, 1998, Proceedings.