On the Efficient Generation of Elliptic Curves over Prime Fields

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

Volumn 2523, Issue , 2003, Pages 333-348

  Konstantinou, Elisavet ^a,b   Stamatiou, Yiannis C ^a,b   Zaroliagis, Christos ^a,b  

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

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; ECONOMIC AND SOCIAL EFFECTS; EFFICIENCY; GEOMETRY; HARDWARE; POLYNOMIALS;

COMPLEX MULTIPLICATION; ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOSYSTEMS; HARDWARE DEVICES; HILBERT POLYNOMIAL; SPACE RESOURCES; TIME EFFICIENCIES; WEBER POLYNOMIALS;

EMBEDDED SYSTEMS;

EID: 35248866341     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36400-5_25     Document Type: Article

References (24)

1. A. O. L. Atkin, F. Morain, Elliptic curves and primality proving, Mathematics of Computation 61 (1993), pp. 29-67.
2. E. R. Berlekamp, Factoring polynomials over large finite fields, Mathematics of Computation 24(1970), pp. 713-735.
3. H. Baier, and J. Buchmann, Efficient construction of cryptographically strong elliptic curves, in Progress in Cryptology - INDOCRYPT 2000, Lecture Notes in Computer Science Vol. 1977 (Springer-Verlag, 2000), pp. 191-202.
4. Ian Blake, Gadiel Seroussi, and Nigel Smart, Elliptic curves in cryptography , London Mathematical Society Lecture Note Series 265, Cambridge University Press, 1999.
5. D. Burton, Elementary Number Theory, McGraw Hill, 4th edition, 1998.
6. h = P, Giornale di Matematiche di Battaglini 46 (1908), pp. 33-90.
7. GNU multiple precision library, edition 3.1.1, September 2000. Available at: htpp://www.swox.com/gmp.
8. IEEE P1363/D13, Standard Specifications for Public-Key Cryptography, ballot draft, 1999. htpp://www.ieee.org/groups/1363/tradPK/draft.html.
9. Implementations of Portions of the P1363 Draft. htpp://www.ieee.org/ groups/1363/P1363/implementations.html.
10. LiDIA. A library for computational number theory, Technical University of Darmstadt. Available from http://www.Informatik.tu-darmstadt.de/TI/LiDIA/ Welcome.html.
11. E. Konstantinou, Y. Stamatiou, and C. Zaroliagis, A Software Library for Elliptic Curve Cryptography, in Proc. 10th European Symposium on Algorithms - ESA 2002 (Engineering and Applications Track), Lecture Notes in Computer Science (Springer-Verlag, 2002), to appear.
12. 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.
13. Multiprecision Integer and Rational Arithmetic C/C++ Library htpp://www.indigo. ie/~mscott/.
14. 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.
15. 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.
16. Erkay Savas, Thomas A. Schmidt, and Cetin K. Koc, Generating Elliptic Curves of Prime Order, in Cryptographic Hardware and Embedded Systems - CHES 2001, Lecture Notes in Computer Science Vol. 2162 (Springer-Verlag, 2001), pp. 145-161.
17. R. Schoof, Counting points on elliptic curves over finite fields, J. Theorie des Nombres de Bordeaux, 7(1995), pp. 219-254.
18. M. Scott, A C++ Implementation of the Complex Multiplication (CM) Elliptic Curve Generation Algorithm from Annex A, in Implementations of Portions of the P1363 Draft. htpp://www.ieee.org/groups/1363/P1363/implementations.html.
19. V. Shoup, NTL: A Library for doing Number Theory, URL: Shoup.net/ntl/.
20. I. A. Semaev, Evaluation of discrete logarithms on some elliptic curves, Mathematics of Computation, 67(1998), pp. 353-356.
21. J. H. Silverman, The Arithmetic of Elliptic Curves, Springer-Verlag, GTM 106, 1986.
22. N. P. Smart, The discrete logarithm problem on elliptic curves of trace one, Journal of Cryptography, 12(1999), pp. 193-196.
23. Thomas Valente, A distributed approach to proving large numbers prime, Rensselaer Polytechnic Institute Troy, New York, Thesis, August 1992.
24. Pate Williams. htpp://www.mindspring.com/~pate.