On the construction of prime order elliptic curves

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2904, Issue , 2003, Pages 309-322

  Konstantinou, Elisavet ^a,b   Stamatiou, Yannis C ^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

[No Author keywords available]

Indexed keywords

GEOMETRY;

BIT PRECISION; COMPLEX MULTIPLICATION; ELLIPTIC CURVE; HILBERT POLYNOMIAL; PRIME ORDERS; WEBER POLYNOMIALS;

POLYNOMIALS;

EID: 0346895370     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24582-7_23     Document Type: Article

References (26)

1. A.O.L. Atkin and F. Morain, Elliptic curves and primality proving, Mathematics of Computation 61(1993), pp. 29-67.
2. H. Baier and J. Buchmann, Efficient construction of cryptographically strong elliptic curves, in Progress in Cryptology - INDOCRYPT 2000, LNCS Vol. 1977 (Springer-Verlag, 2000), pp. 191-202.
3. 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.
4. 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.
5. I. Blake, G. Seroussi, and N. Smart, Elliptic curves in cryptography, London Mathematical Society Lecture Note Series 265, Cambridge Univ. 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. h = P, Giornale di Matematiche di Battaglini 46 (1908), pp. 33-90.
9. A. Enge and F. Morain, Comparing Invariants for Class Fields of Imaginary Quadratic Fields, in ANTS V, LNCS Vol. 2369, pp. 252-266, 2002.
10. GNU multiple precision library, edition 3.1.1, September 2000. Available at: http://www.swox.com/gmp.
11. N. Gura, H. Eberle, and S.C. Shantz, Generic Implementations of Elliptic Curve Cryptography using Partial Reduction, in Proc. 9th ACM Conf. on Computer and Communications Security - CCS'02, pp. 108-116.
12. A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, and M. Yung, Proactive Public Key and Signature Systems, in Proc. 4th ACM Conf. on Computer and Communications Security - CCS'97, pp. 100-110.
13. IEEE P1363/D13, Standard Specifications for Public-Key Cryptography, 1999. http://grouper.ieee.org/groups/1363/tradPK/draft.html.
14. LiDIA. A library for computational number theory, Technical University of Darmstadt. Available from http://www.informatik.tu-darmstadt.de/TI/LiDIA/ Welcome.html.
15. E. Kaltofen, T. Valente, and N. Yui, An Improved Las Vegas Primality Test, in Proc. ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, pp. 26-33, 1989.
16. E. Kaltofen and N. Yui, Explicit construction of the Hilbert class fields of imaginary quadratic fields by integer lattice reduction. Research Report 89-13, Renseelaer Polytechnic Institute, May 1989.
17. 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, LNCS Vol. 2523 (Springer-Verlag, 2002), pp. 333-348.
18. 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.
19. F. Morain, Building Cyclic Elliptic Curves Modulo Large Primes, in Advances in Cryptology - Eurocrypt '91, LNCS 547 (Springer Verlag), pp. 328-336, 1991.
20. V. Müller and S. Paulus, On the Generation of Cryptographically Strong Elliptic Curves, preprint, 1997.
21. p2c, in Proc. of the International workshop on Coding and Cryptography, March 2003.
22. 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.
23. J. H. Silverman, The Arithmetic of Elliptic Curves, Springer, GTM 106, 1986.
24. A.-M. Spallek, Konstruktion einer elliptischen Kurve über einem endlichen Körper zu gegebener Punktegruppe, Master Thesis, Universität GH Essen, 1992.
25. T. Valente, A distributed approach to proving large numbers prime, Rensselaer Polytechnic Institute Troy, New York, PhD Thesis, August 1992.
26. A. Weng, Konstruktion kryptographisch geeigneter Kurven mit komplexer Multiplikation, PhD thesis, Institut für Experimentelle Mathematik, Universität GH Essen, 2001.