Generating elliptic curves of prime order

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

Volumn 2162, Issue , 2001, Pages 142-158

  Savaş, Erkay ^a   Schmidt, Thomas A ^b   Koç, Çetin K ^a  

^a Oregon State University   (United States)

^b OREGON STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; GEOMETRY;

ALGEBRAIC NUMBER FIELDS; CLASS NUMBERS; COMPLEX MULTIPLICATION; ELLIPTIC CURVE; FINITE FIELDS; OFF-LINE PROCESS; ON-LINE PROCESS; PRIME ORDERS;

EMBEDDED SYSTEMS;

EID: 84944900709     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44709-1_13     Document Type: Conference Paper

References (19)

1. A. O. L. Atkin and F. Morain. Elliptic curves and primality proving. Mathematics of Computation, 61(203):29-68, July 1993.
2. H. Cohen. A Course in Computational Algebraic Number Theory. Springer, Berlin, Germany, 1997.
3. H. Cohn. Advanced Number Theory. Dover Publications, New York, NY, 1980.
4. D. A. Cox. Primes of the Form x2+ny2: Fermat, Class Field Theory and Complex Multiplication. John Wiley & Sons, New York, NY, 1989.
5. R. Gross and J. H. Smith. Ageneralization of a conjecture of hardy and littlewood to algebraic number fields. Rocky Mountain J. Math, 30(1):195-215, 2000.
6. G. H. Hardy and J. E. Littlewood. Some problems of ’partitio numerorum’ iii: On the expression of a number as a sum of primes. Acta. MAth, 44:1-70, 1922.
7. IEEE. P1363: Standard specifications for public-key cryptography. Draft Version 13, November 12, 1999.
8. N. Koblitz. Primality of the number of points on an elliptic curve over a finite field. Pacific J. Math., 131(1):157-165, 1988.
9. N. Koblitz, A. Menezes, and S. Vanstone. The state of elliptic curve cryptography. towards a quarter-century of public key cryptography. Designs, Codes and Cryptography, 19(2-3):173-193, 2000.
10. G.-H. Lay and H. G. Zimmer. Constructing elliptic curves with given group order over large finite fields. Algorithmic number theory (Ithaca, NY, 1994), pages 157-165, 1994.
11. A. K. Lenstra. Efficient identity based parameter selection for elliptic curve cryptosystems. Information Security and Privacy—ACISP ’99 (Wollongong), pages 294-302, 1999.
12. H. W. Lenstra Jr. Factoring integers with elliptic curves. Annals of Mathematics, 126(3):649-673, 1987.
13. A. Miyaji. Elliptic curves over Fp suitable for cryptosystems. In J. Seberry and Y. Zheng, editors, Advances in Cryptology-AUSCRYPT 92, Lecture Notes in Computer Science, No. 718, pages 492-504. Springer, Berlin, Germany, 1992.
14. T. Satoh and K. Araki. Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves. Commentarii Math. Univ. St. Pauli, 47:81-92, 1998.
15. M. Scott. AC++ implementation of the complex cultiplication (CM) elliptic curve generation algorithm from Annex A. http://grouper.ieee.org/groups/1363/P1363/implementations.html, March 14, 2000.
16. I. A. Semaev. Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p. Mathematics of Computation, 67(221):353-356, January 1998.
17. V. Shoup. NTL: A Library for doing Number Theory (version 5.0c). http://shoup.net/ntl/, 2001.
18. J. H. Silverman. The Arithmetic of Elliptic Curves. Springer, Berlin, Germany, 1986.
19. N.P. Smart. The discrete logarithm problem on elliptic curves of trace one. Journal of Cryptography, 12:193-196, 1999.