The 2-adic CM method for genus 2 curves with application to cryptography

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

Volumn 4284 LNCS, Issue , 2006, Pages 114-129

  Gaudry, P ^a,b   Houtmann, T ^b   Kohel, D ^c   Ritzenthaler, C ^d   Weng, A ^b  

^a LORIA   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

^c UNIVERSITY OF SYDNEY   (Australia)

^d AIX MARSEILLE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

ANALYTIC METHOD; CLASS NUMBERS; COMPLEX MULTIPLICATION; FINITE FIELDS; GENUS 2 CURVES; HYPER-ELLIPTIC CURVES; POLYNOMIAL SYSTEMS; POTENTIAL THREATS;

CRYPTOGRAPHY;

EID: 38049051718     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11935230_8     Document Type: Conference Paper

References (40)

1. S. Arno, D. H. Bailey, and H. R. P. Ferguson. Analysis of PSLQ, an integer relation finding algorithm. Math. Comp., 68(225):351-369, January 1999.
2. R. Avanzi. Aspects of hyperelliptic curves over large prime fields in software implementations, 2003. Preprint (available at http://eprint.iacr.org/ 2003/253).
3. A. Borel, S. Chowla, C. S. Herz, K. Iwasawa, and J.-P. Serre. Seminar on complex multiplication. Number 21 in Lecture Notes in Math. Springer, 1966.
4. Z. I. Borevitch and I. R. Shafarevich. Number theory, volume 20 of Pure and Applied Mathematics. Academic Press Inc., New-York, 1966.
5. J.-B. Bost and J.-F. Mestre. Moyenne arithmético- géométrique et périodes de courbes de genre 1 et 2. Gaz. Math. Soc. France, 38:36-64, 1988.
6. R. Bröker and P. Stevenhagen. Elliptic curves with a given number of points. In D. Buell, editor, ANTS-VI, vol. 3076 of LNCS, pages 117-131. Springer-Verlag, 2004.
7. R. M. Bröker. Constructing elliptic curves of prescribed order. PhD thesis, Thomas Stieltjes Institute for Mathematics, 2006.
8. R. Carls. A generalized arithmetic geometric mean. PhD thesis, Rijksuniversiteit Groningen, 2004.
9. J. Chao, K. Matsuo, H. Kawashiro, and S. Tsujii. Construction of hyperelliptic curves with CM and its application to cryptosystems. In T. Okamoto, editor, ASIACRYPT 2000, vol. 1976 of LNCS, pages 259-273. Springer-Verlag, 2000.
10. H. Cohen. A course in algorithmic algebraic number theory, volume 138 of Graduate Texts in Mathematics. Springer-Verlag, 1993. Second corrected printing, 1995.
11. H. Cohen and H. W. Lenstra, Jr. Heuristics on class groups of number fields. In Number theory, Noordwijkerhout 1983, volume 1068 of Lecture Notes in Math., pages 33-62. Springer, Berlin, 1984.
12. The University of Sydney Computational Algebra Group. Magma online handbook, 2006. http://magma.maths.usyd.edu.au/magma/htmlhelp/MAGMA.htm.
13. J.-M. Couveignes and T. Henocq. Action of modular correspondences around CM points. In C. Fieker and D. R. Kohel, editors, ANTS-V, vol. 2369 of LNCS, pages 234-243. Springer-Verlag, 2002.
14. M. Deuring. Die Typen der Multiplikatoringe elliptischer Funktionenkörper. Abh. Math. Sem. Hansischen, 14:197-272, 1941.
15. R. Dupont. Moyenne arithmético-géométrique, suites de Borchardt et applications. PhD thesis, École polytechnique, 2006.
16. K. Eisentrager and K. Lauter. Computing Igusa class polynomials via Chinese Remainder Theorem. 2004. Preprint (available at http://arxiv.org/abs/ math.NT/0405305), 2004.
17. P. Gaudry. Fast genus 2 arithmetic based on Theta functions, 2005. Preprint (available at http://eprint.iacr.org/2005/314).
18. P. Gaudry and É. Schost. Construction of secure random curves of genus 2 over prime fields. In C. Cachin and J. Camenisch, editors, Eurocrypt 2004, vol. 3027 of LNCS, pages 239-256. Springer-Verlag, 2004.
19. E. Z. Goren. On certain reduction problems concerning abelian surfaces. Manuscripta math., 94:33-43, 1997.
20. E. Z. Goren and K. Lauter. Class invariants for quartic CM fields. Preprint (available at http://arxiv.org/abs/math.NT/0404378), 2004.
21. N. Koblitz. p-adic Numbers, p-adic Analysis and Zeta-Functions, volume 58 of Graduate Texts in Mathematics. Springer-Verlag, 1984.
22. T. Lange and M. Stevens. Efficient doubling on genus two curves over binary fields. vol. 3357 of LNCS, pages 170-181. Springer-Verlag, 2005. In H. Handschuhand M.A. Hasan, editors, SAC 2004.
23. R. Lercier and D. Lubicz. A quasi quadratic time algorithm for hyperelliptic curve point counting. To appear in J. Ramanujan Math. Soc.
24. R. Lercier and E. Riboulet-Deyris. Elliptic curves with complex multiplication. Posting to the Number Theory List, available at http://listserv.nodak.edu/cgi-bin/wa.exe?A2=ind0401&L=nmbrthry&P=R305, 2004.
25. J. Lubin, J.-P. Serre, and J. Tate. Elliptic curves and formal groups. In Lecture notes prepared in connection with the seminars held at the Summer Institute on Algebraic Geometry, Whitney Estate, Woods Hole, Massachusetts, July 6-July 31, 1964, 1964. Scanned copies available at http://www.ma.utexas. edu/users/voloch/lst.html.
26. J.-F. Mestre. Algorithmes pour compter des points de courbes en petite caractéristique et en petit genre. Talk given in Rennes in March 2002. Notes written by D. Lubicz.
27. 2n). Lettre adressée à Gaudry et Harley, Décembre 2000.
28. J.-F. Mestre. Construction de courbes de genre 2 à partir de leurs modules. In T. Mora and C. Traverso, editors, Effective methods in algebraic geometry, vol. 94 of Progr. Math., pages 313-334. Birkhäuser, 1991.
29. A. Miyaji, M. Nakabayashi, and S. Takano. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundamentals, E84-A(5), May 2001.
30. P. Nguyên and D. Stehlé. Floating-point LLL revisited. In Eurocrypt 2005, vol. 3494 of LNCS, pages 215-233. Springer-Verlag, 2005.
31. J. Pelzl, T.Wollinger, J. Guajardo, and C. Paar. Hyperelliptic curve cryptosystems: Closing the performance gap to elliptic curves. Preprint, 2003.
32. Takakazu Satoh. The canonical lift of an ordinary elliptic curve over a finite field and its point counting. J. Ramanujan Math. Soc., 15(4):247-270, 2000.
33. G. Shimura. Abelian Varieties with complex multiplication and modular functions. Princeton University Press, revised edition, 1998.
34. V. Shoup. NTL: A library for doing number theory. http://www.shoup.net/ ntl/.
35. A.-M. Spallek. Kurven vom Geschlecht 2 und ihre Anwendung in Public-Key-Kryptosystemen. PhD thesis, Universität Gesamthochschule Essen, July 1994.
36. D. Stehlé. fplll-1.2 a lattice LLL-reduction program, 2006. available at http://www.loria.fr/~stehle.
37. E. Thomé. Multi-Precision for LOCal-fields library, 2006. still under development, see http://www.loria.fr/~thome.
38. P. van Wamelen. Examples of genus two CM curves defined over the rationals. Math. Comp., 68(225):307-320, January 1999
39. F. Vercauteren. Computing zeta functions of curves over finite fields. PhD thesis, Katholieke Universiteit Leuven, 2003.
40. A. Weng. Konstruktion kryptographisch geeigneter Kurven mit komplexer Multiplikation. PhD thesis, Universität GH Essen, 2001.