Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields

Abstract We present a fast algorithm for building ordinary elliptic curves over finite prime fields having arbitrary small MOV degree. The elliptic curves are obtained using complex multiplication by any desired discriminant.

[1]  Kenneth G. Paterson,et al.  ID-based Signatures from Pairings on Elliptic Curves , 2002, IACR Cryptol. ePrint Arch..

[2]  Annegret Weng,et al.  Elliptic Curves Suitable for Pairing Based Cryptography , 2005, Des. Codes Cryptogr..

[3]  Nigel P. Smart,et al.  An Identity Based Authenticated Key Agreement Protocol Based on the Weil Pairing , 2002, IACR Cryptol. ePrint Arch..

[4]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[5]  Jung Hee Cheon,et al.  An Identity-Based Signature from Gap Diffie-Hellman Groups , 2003, Public Key Cryptography.

[6]  Andreas Enge,et al.  Provably secure non-interactive key distribution based on pairings , 2006, Discret. Appl. Math..

[7]  H. Davenport.  Multiplicative Number Theory , 1967 .

[8]  Paulo S. L. M. Barreto,et al.  Constructing Elliptic Curves with Prescribed Embedding Degrees , 2002, SCN.

[9]  Alfred Menezes,et al.  Reducing elliptic curve logarithms to logarithms in a finite field , 1993, IEEE Trans. Inf. Theory.

[10]  Hovav Shacham,et al.  Short Signatures from the Weil Pairing , 2001, J. Cryptol..

[11]  Antoine Joux,et al.  A One Round Protocol for Tripartite Diffie–Hellman , 2000, Journal of Cryptology.

[12]  François Morain.  Building Elliptic Curves Modulo Large Primes , 1991, EUROCRYPT.

[13]  J. Silverman.  Advanced Topics in the Arithmetic of Elliptic Curves , 1994 .

[14]  Guillaume Hanrot,et al.  Solvability by radicals from an algorithmic point of view , 2001, ISSAC '01.

[15]  C. Siegel,et al.  Über die Classenzahl quadratischer Zahlkörper , 1935 .

[16]  A. Miyaji,et al.  New Explicit Conditions of Elliptic Curve Traces for FR-Reduction , 2001 .

[17]  Marc Joye,et al.  Fast Point Multiplication on Elliptic Curves through Isogenies , 2003, AAECC.

[18]  A. Atkin,et al.  ELLIPTIC CURVES AND PRIMALITY PROVING , 1993 .

[19]  G. Frey.  Applications of Arithmetical Geometry to Cryptographic Constructions , 2001 .

[20]  Matthew K. Franklin,et al.  Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[21]  Horst G. Zimmer,et al.  Constructing elliptic curves with given group order over large finite fields , 1994, ANTS.

[22]  Andreas Enge,et al.  Fast Decomposition of Polynomials with Known Galois Group , 2003, AAECC.

[23]  Florian Hess,et al.  Efficient Identity Based Signature Schemes Based on Pairings , 2002, Selected Areas in Cryptography.

[24]  R. Balasubramanian,et al.  The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes—Okamoto—Vanstone Algorithm , 1998, Journal of Cryptology.