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

Pierrick Gaudry (1) , Thomas Houtmann (2) , David Kohel (3) , Christophe Ritzenthaler (4) , Annegret Weng (2)

1 SPACES - Solving problems through algebraic computation and efficient software
2 TANC - Algorithmic number theory for cryptology
3 School of Mathematics and statistics [Sydney]
4 IML - Institut Mathématiques de Luminy

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 Q(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 (j1, j2, j3) 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.

Domaines: Cryptographie et sécurité [cs.CR]

Pierrick Gaudry, Thomas Houtmann, David Kohel, Christophe Ritzenthaler, Annegret Weng. The 2-adic CM method for genus 2 curves with application to cryptography. Asiacrypt 2006, Dec 2006, Shangai, China. pp.114-129. ⟨inria-00103435⟩