Building curves with arbitrary small MOV degree over finite prime fields

Journal of Cryptology

Volumn 18, Issue 2, 2005, Pages 79-89

  Dupont, Régis ^a   Enge, Andreas ^a   Morain, François ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Complex multiplication; Elliptic curves over finite fields; MOV degree

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA PRIVACY; PROBLEM SOLVING; SECURITY OF DATA;

COMPLEX MULTIPLICATION; ELLIPTIC CURVES OVER FINITE FIELDS; IDENTITY BASED ENCRYPTION; MOV DEGREE;

CRYPTOGRAPHY;

EID: 17444391606     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00145-004-0219-7     Document Type: Article

References (35)

1. A. O. L. Atkin and F. Morain. Elliptic curves and primality proving. Math. Comp., 61(203):29-68, July 1993.
2. R. Balasubramanian and N. Koblitz. The improbability that an elliptic curve has subexponemial discrete log problem under the Menezes-Okamotc-Vanstone algorithm. J. Cryptology, 11:141-145, 1998.
3. P. Barreto, B. Lynn, and M. Scott. Constructing elliptic curves with prescribed embedding degrees. In S. Cimato, C. Galdi, and G. Persiano, editors, Security in Communication Networks - Third International Conference, SCN 2002, Amalfi, Italy, September 2002, volume 2576 of Lecture Notes in Computer Science, pages 257-267. Springer-Verlag, Berlin, 2003.
4. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. In J. Kilian, editor, Advances in Cryptology - CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 213-229. Springer-Verlag, Berlin, 2001.
5. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. In C. Boyd, editor, Advances in Cryptology - ASIACRYPT 2001, volume 2248 of Lecture Notes in Computer Science, pages 514-532. Springer-Verlag, Berlin, 2001.
6. F. Brezing and A. Weng. Elliptic curves suitable for pairing based cryptography. Available as http://eprint.iacr.org/2003/143/, July 2003.
7. E. Brier and M. Joye. Fast point multiplication on elliptic curves through isogenies. In M. Fossorier, T. Høholdt, and A. Poli, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, volume 2643 of Lecture Notes in Computer Science, pages 43-50. Springer-Verlag, Berlin, 2003. (15th International Symposium, AAECC-15, Toulouse, France, May 2003, Proceedings.)
8. J. Cha and J. Cheon. An identity-based signature from gap Diffie-Hellman groups. In Y. Desmedt, editor, Public Key Cryptography - PKC 2003, volume 2567 of Lecture Notes in Computer Science, pages 18-30. Springer-Verlag, Berlin, 2002.
9. Computational Algebra Group of the University of Sydney. MAGMA, version 2.10, 2003. http://magma.maths.usyd.edu.au/magma/.
10. 2. Wiley, New York, 1989.
11. H. Davenport. Multiplicative Number Theory, 2nd edition, volume 74 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1980.
12. R. Dupont and A. Enge. Provably secure non-interactive key distribution based on pairings. In D. Augot, P. Charpin, and G. Kabatianski, editors, WCC 2003 - Proceedings of the International Workshop on Coding and Cryptography, pages 165-174. École Supérieure et d'Application des Transmissions, 2003. To appear also in Discrete Appl. Math.
13. R. Dupont and A. Enge. Provably secure non-interactive key distribution based on pairings. In D. Augot, P. Charpin, and G. Kabatianski, editors, WCC 2003 - Proceedings of the International Workshop on Coding and Cryptography, pages 165-174. École Supérieure et d'Application des Transmissions, 2003. To appear also in Discrete Appl. Math.
14. A. Enge and F. Morain. Further investigations of the generalised Weber functions. In preparation, 2001.
15. A. Enge and F. Morain. Fast decomposition of polynomials with known Galois group. In M. Fossorier, T. Høholdt, and A. Poli, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - AAECC-15, volume 2643 of Lecture Notes in Computer Science, pages 254-264. Springer-Verlag, Berlin, 2003.
16. A. Enge and R. Schertz. Constructing elliptic curves from modular curves of positive genus. Submitted, 2001.
17. A. Enge and P. Zimmermann. MPC - Multiprecision complex arithmetic library, version 0.4.1, 2002. Available at http://www.loria.fr/~zimmerma/free/.
18. q5, held at the University of Augsburg, Germany, August 2-6, 1999, pages 128-161. Springer-Verlag, Berlin, 2001.
19. J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, Cambridge, 1999.
20. T. Granlund and K. Ryde. GMP - GNU multiprecision library, version 4.1.2, 2002. Available at http://www.swox.com/gmp/.
21. G. Hanrot, V. Lefèvre, K. Ryde, and P. Zimmermann. MPFR - Multiprecision floating point library with exact rounding, version contained in [19], 2002. Available at http://www.mpfr.org/.
22. G. Hanrot and F. Morain. Solvability by radicals from an algorithmic point of view. In B. Mourrain, editor, ISSAC 2001 - Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, pages 175-182. Association for Computing Machinery, New York, 2001.
23. F. Hess. Efficient identity based signature schemes based on pairings. In K. Nyberg and H. Heys, editors, Selected Areas in Cryptography - SAC 2002, volume 2595 of Lecture Notes in Computer Science, pages 310-324. Springer-Verlag, Berlin, 2003.
24. A. Joux. A one round protocol for tripartite Diffie-Hellman. In W. Bosma, editor, Algorithmic Number Theory, volume 1838 of Lecture Notes in Computer Science, pages 385-393. Springer-Verlag, Berlin, 2000.
25. G.-J. Lay and H. G. Zimmer. Constructing elliptic curves with given group order over large finite fields. In L. Adleman and M.-D. Huang, editors, ANTS-I, volume 877 of Lecture Notes in Computer Science, pages 250-263. Springer-Verlag, Berlin, 1994.
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. V. Miller. Short programs for functions on curves. Draft, 1986.
28. A. Miyaji, M. Nakabayashi, and S. Takano. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundamentals, E84-A(5):1234-1243, May 2001.
29. F. Morain. Building cyclic elliptic curves modulo large primes. In D. Davies, editor, Advances in Cryptology - EUROCRYPT '91, volume 547 of Lecture Notes in Computer Science, pages 328-336. Springer-Verlag, Berlin, 1991.
30. K. Paterson. Information theory - ID-based signatures from pairings on elliptic curves. Electron. Lett., 38(18):1025-1026, 2002.
31. R. Sakai, K. Ohgishi, and M. Kasahara. Cryptosystems based on pairing. Presented at SCIS 2000, The 2000 Symposium on Cryptography and Information Security, Okinawa, Japan, January 26-28.
32. V. Shoup. NTL - Number Theory Library, version 5.3, 2002. Available at http://shoup.net/nt1/.
33. C. L. Siegel. Über die Classenzahl quadratischer Zahlkörper. Acta Arith., 1:83-86, 1935.
34. J. H. Silverman. Advanced Topics in the Arithmetic of Elliptic Curves, volume 151 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1994.
35. N. Smart. Information theory - identity-based authenticated key agreement protocol based on Weil pairing. Electron. Lett., 38(13):630-631, 2002.