Abstract
The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suitable for cryptography. Since low class number might be seen as a potential threat, it is of interest to push the method as far as possible. We have thus designed a new algorithm for the construction of CM invariants of genus 2 curves, using 2-adic lifting of an input curve over a small finite field. This provides a numerically stable alternative to the complex analytic method in the first phase of the CM method for genus 2. As an example we compute an irreducible factor of the Igusa class polynomial system for the quartic CM field ℚ \((i\sqrt{75 + 12\sqrt{17}})\), whose class number is 50. We also introduce a new representation to describe the CM curves: a set of polynomials in (j 1,j 2,j 3) which vanish on the precise set of triples which are the Igusa invariants of curves whose Jacobians have CM by a prescribed field. The new representation provides a speedup in the second phase, which uses Mestre’s algorithm to construct a genus 2 Jacobian of prime order over a large prime field for use in cryptography.
Chapter PDF
References
Arno, S., Bailey, D.H., Ferguson, H.R.P.: Analysis of PSLQ, an integer relation finding algorithm. Math. Comp. 68(225), 351–369 (1999)
Avanzi, R.: Aspects of hyperelliptic curves over large prime fields in software implementations (preprint, 2003), Available at: http://eprint.iacr.org/2003/253
Borel, A., Chowla, S., Herz, C.S., Iwasawa, K., Serre, J.-P.: Seminar on complex multiplication. Lecture Notes in Math., vol. 21. Springer, Heidelberg (1966)
Borevitch, Z.I., Shafarevich, I.R.: Number theory. Pure and Applied Mathematics, vol. 20. Academic Press Inc., New York (1966)
Bost, J.-B., Mestre, J.-F.: Moyenne arithmético-géométrique et périodes de courbes de genre 1 et 2. Gaz. Math. Soc. 38, 36–64 (1988)
Bröker, R., Stevenhagen, P.: Elliptic curves with a given number of points. In: Buell, D.A. (ed.) ANTS 2004. LNCS, vol. 3076, pp. 117–131. Springer, Heidelberg (2004)
Bröker, R.M.: Constructing elliptic curves of prescribed order. Ph.D thesis, Thomas Stieltjes Institute for Mathematics (2006)
Carls, R.: A generalized arithmetic geometric mean. Ph.D thesis, Rijksuniversiteit Groningen (2004)
Chao, J., Matsuo, K., Kawashiro, H., Tsujii, S.: Construction of hyperelliptic curves with CM and its application to cryptosystems. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 259–273. Springer, Heidelberg (2000)
Cohen, H.: A course in algorithmic algebraic number theory. Graduate Texts in Mathematics, vol. 138. Springer, Heidelberg (1993); Second corrected printing (1995)
Cohen, H., Lenstra Jr., H.W.: Heuristics on class groups of number fields. In: Number theory, Noordwijkerhout 1983. Lecture Notes in Math., vol. 1068, pp. 33–62. Springer, Berlin (1984)
The University of Sydney Computational Algebra Group. Magma online handbook (2006), http://magma.maths.usyd.edu.au/magma/htmlhelp/MAGMA.htm
Couveignes, J.-M., Henocq, T.: Action of modular correspondences around CM points. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 234–243. Springer, Heidelberg (2002)
Deuring, M.: Die Typen der Multiplikatoringe elliptischer Funktionenkörper. Abh. Math. Sem. Hansischen 14, 197–272 (1941)
Dupont, R.: Moyenne arithmético-géométrique, suites de Borchardt et applications. Ph.D thesis, École polytechnique (2006)
Eisentrager, K., Lauter, K.: Computing Igusa class polynomials via Chinese Remainder Theorem 2004 (preprint, 2004), Available at: http://arxiv.org/abs/math.NT/0405305
Gaudry, P.: Fast genus 2 arithmetic based on Theta functions (preprint, 2005), available at: http://eprint.iacr.org/2005/314
Gaudry, P., Schost, É.: Construction of secure random curves of genus 2 over prime fields. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 239–256. Springer, Heidelberg (2004)
Goren, E.Z.: On certain reduction problems concerning abelian surfaces. Manuscripta math. 94, 33–43 (1997)
Goren, E.Z., Lauter, K.: Class invariants for quartic CM fields (preprint, 2004), available at: http://arxiv.org/abs/math.NT/0404378
Koblitz, N.: p-adic Numbers, p-adic Analysis and Zeta-Functions. Graduate Texts in Mathematics, vol. 58. Springer, Heidelberg (1984)
Lange, T., Stevens, M.: Efficient doubling on genus two curves over binary fields. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol. 3357, pp. 170–181. Springer, Heidelberg (2004)
Lercier, R., Lubicz, D.: A quasi quadratic time algorithm for hyperelliptic curve point counting. J. Ramanujan Math. Soc. (to appear)
Lercier, R., Riboulet-Deyris, E.: Elliptic curves with complex multiplication. Posting to the Number Theory List (2004), Avaliable at: http://listserv.nodak.edu/cgi-bin/wa.exe?A2=ind0401&L=nmbrthry&P=R305
Lubin, J., Serre, J.-P., Tate, J.: Elliptic curves and formal groups. 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), Scanned copies available at: http://www.ma.utexas.edu/users/voloch/lst.html
Mestre, J.-F.: 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 Lubicz, D.(2002)
Mestre, J.-F.: Utilisation de l’AGM pour le calcul de \(E(F_{2^n})\). Lettre adressée à Gaudry et Harley (Décember 2000)
Mestre, J.-F.: Construction de courbes de genre 2 à partir de leurs modules. In: Mora, T., Traverso, C. (eds.) Effective methods in algebraic geometry. Progr. Math., vol. 94, pp. 313–334. Birkhäuser, Basel (1991)
Miyaji, A., Nakabayashi, M., Takano, S.: New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundamentals E84-A(5) (May 2001)
Nguên, P.Q., Stehlé, D.: Floating-Point LLL Revisited. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 215–233. Springer, Heidelberg (2005)
Pelzl, J., Wollinger, T., Guajardo, J., Paar, C.: Hyperelliptic curve cryptosystems: Closing the performance gap to elliptic curves (preprint, 2003)
Satoh, T.: 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)
Shimura, G.: Abelian Varieties with complex multiplication and modular functions, revised edition. Princeton University Press, Princeton (1998)
Shoup, V.: NTL: A library for doing number theory, http://www.shoup.net/ntl/
Spallek, A.-M.: Kurven vom Geschlecht 2 und ihre Anwendung in Public-Key-Kryptosystemen. Ph.D thesis, Universität Gesamthochschule Essen (July 1994)
Stehlé, D.: fplll-1.2 a lattice LLL-reduction program (2006), Available at: http://www.loria.fr/~stehle
Thomé, E.: Multi-Precision for LOCal-fields library, still under development (2006), see http://www.loria.fr/~thome
van Wamelen, P.: Examples of genus two CM curves defined over the rationals. Math. Comp. 68(225), 307–320 (1999)
Vercauteren, F.: Computing zeta functions of curves over finite fields. Ph.D thesis, Katholieke Universiteit Leuven (2003)
Weng, A.: Konstruktion kryptographisch geeigneter Kurven mit komplexer Multiplikation. Ph.D thesis, Universität GH Essen (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gaudry, P., Houtmann, T., Kohel, D., Ritzenthaler, C., Weng, A. (2006). The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography. In: Lai, X., Chen, K. (eds) Advances in Cryptology – ASIACRYPT 2006. ASIACRYPT 2006. Lecture Notes in Computer Science, vol 4284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11935230_8
Download citation
DOI: https://doi.org/10.1007/11935230_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49475-1
Online ISBN: 978-3-540-49476-8
eBook Packages: Computer ScienceComputer Science (R0)