Generating prime order elliptic curves: Difficulties and efficiency considerations

Lecture Notes in Computer Science

Volumn 3506, Issue , 2005, Pages 261-278

  Konstantinou, Elisavet ^a,b   Kontogeorgis, Aristides ^c   Stamatiou, Yannis C ^a,c,d   Zaroliagis, Christos ^a,b  

^a University of Patras and Computer Technology Institute   (Greece)

^b UNIVERSITY OF PATRAS   (Greece)

^c UNIVERSITY OF THE AEGEAN   (Greece)

^d ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

Author keywords

Class Field Polynomials; Complex Multiplication; Elliptic Curve Cryptosystems; Generation of Prime Order Elliptic Curves

Indexed keywords

LARGE SCALE SYSTEMS; NUMERICAL METHODS; POLYNOMIALS; SECURITY SYSTEMS;

CLASS FIELD POLYNOMIALS; COMPLEX MULTIPLICATION; ELLIPTIC CURVE CRYPTOSYSTEM; GENERATION OF PRIME ORDER ELLIPTIC CURVES;

CRYPTOGRAPHY;

EID: 24944508069     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496618_20     Document Type: Conference Paper

References (32)

1. A.O.L. Atkin and F. Morain, Elliptic curves and primality proving, Mathematics of Computation 61(1993), pp. 29-67.
2. H. Baier, Elliptic Curves of Prime Order over Optimal Extension Fields for Use in Cryptography, in Progress in Cryptology - INDOCRYPT 2001, LNCS Vol. 2247 (Springer-Verlag, 2001), pp. 99-107.
3. H. Baier, Efficient Algorithms for Generating Elliptic Curves over Finite Fields Suitable for Use in Cryptography, PhD Thesis, Dept. of Computer Science, Technical Univ. of Darmstadt, May 2002.
4. E. R. Berlekamp, Factoring polynomials over large finite fields, Mathematics of Computation 24(1970), pp. 713-735.
5. I. Blake, G. Seroussi, and N. Smart, Elliptic curves in cryptography, London Mathematical Society Lecture Note Series 265, Cambridge University Press, 1999.
6. D. Boneh, B. Lynn, and H. Shacham, Short signatures from the Weil pairing, in ASIACRYPT 2001, LNCS 2248, pp. 514-532, Springer-Verlag, 2001.
7. H. Cohen, A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics, 138, Springer-Verlag, Berlin, 1993.
8. 2, John Wiley and Sons, New York, 1989.
9. A. Enge and F. Morain, Comparing invariants for class fields of imaginary quadratic fields, in Algebraic Number Theory - ANTS V, Lecture Notes in Computer Science Vol. 2369, Springer-Verlag, pp. 252-266, 2002.
10. A. Enge and R. Schertz, Constructing elliptic curves from modular curves of positive genus, Preprint, 2003.
11. S. Galbraith and J. McKee, The probability that the number of points on an elliptic curve over a finite field is prime, Journal of the London Mathematical Society, 62(2000), no. 3, pp. 671-684.
12. GNU multiple precision library, edition 3.1.1, September 2000. Available at: http://www.swox.com/gmp.
13. IEEE P1363/D13, Standard Specifications for Public-Key Cryptography, 1999. http://grouper.ieee.org/groups/1363/tradPK/draft.html.
14. E. Kaltofen and N. Yui, Explicit construction of the Hilbert class fields of imaginary quadratic fields by integer lattice reduction. Research Report 89-13, Rensselaer Polytechnic Institute, May 1989.
15. E. Konstantinou, Y. Stamatiou, and C. Zaroliagis, On the Efficient Generation of Elliptic Curves over Prime Fields, in Cryptographic Hardware and Embedded Systems - CHES 2002, Lecture Notes in Computer Science Vol. 2523, Springer-Verlag, pp. 333-348, 2002.
16. E. Konstantinou, Y.C. Stamatiou, and C. Zaroliagis, On the Construction of Prime Order Elliptic Curves, in Progress in Cryptology - INDOCRYPT 2003, Lecture Notes in Computer Science Vol. 2904, Springer-Verlag, pp. 309-322, 2003.
17. G.J. Lay and H. Zimmer, Constructing Elliptic Curves with Given Group Order over Large Finite Fields, in Algorithmic Number Theory - ANTS-I, Lecture Notes in Computer Science Vol. 877, Springer-Verlag, pp. 250-263, 1994.
18. A. J. Menezes, T. Okamoto and S. A. Vanstone, Reducing elliptic curve logarithms to a finite field, IEEE Trans. Info. Theory, 39(1993), pp. 1639-1646.
19. A. Miyaji, M. Nakabayashi, and S. Takano, Characterization of Elliptic Curve Traces under FR-reduction, in International Conference on Information Security and Cryptology - ICISC 2000, Lecture Notes in Computer Science Vol. 2015, Springer-Verlag, pp. 90-108, 2001.
20. A. Miyaji, M. Nakabayashi, and S. Takano, New explicit conditions of elliptic curve traces for FR-reduction, IEICE Transactions on Fundamentals, E84-A(5):1234-1243, 2001.
21. F. Morain, Modular curves and class invariants, Preprint, June 2000.
22. F. Morain, Computing the cardinality of CM elliptic curves using torsion points, Preprint, October 2002.
23. p2c, in Proc. of the International workshop on Coding and Cryptography, March 2003.
24. G. C. Pohlig and M. E. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Trans. Info. Theory, 24 (1978), pp. 106-110.
25. T. Satoh and K. Araki, Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves, Comm. Math. Univ. Sancti Pauli, 47(1998), pp. 81-91.
26. E. Savaş, T.A. Schmidt, and Ç.K. Koç, Generating Elliptic Curves of Prime Order, in Cryptographic Hardware and Embedded Systems - CHES 2001, LNCS Vol. 2162 (Springer-Verlag, 2001), pp. 145-161.
27. R. Schertz, Weber's class invariants revisited, Journal de Théorie des Nombres de Bordeaux 4, pp. 325-343, 2002.
28. R. Schoof, Counting points on elliptic curves over finite fields, J. Theorie des Nombres de Bordeaux, 7(1995), pp.219-254.
29. M. Scott and P. S.L.M. Barreto, Generating more MNT elliptic curves, Cryptology ePrint Archive, Report 2004/058, 2004.
30. J. H. Silverman, The Arithmetic of Elliptic Curves, Springer-Verlag, GTM 106, 1986.
31. I. Stewart, Galois Theory, Third Edition, Chapman & Hall/CRC, Boca Raton, FL, 2004.
32. I. Stewart and D. Tall, Algebraic Number Theory, Second Edition, Chapman & Hall, London, 1987.