Presentation - Part 1 Presentation - Part 2 April 23rd, 2002
Report May 4th, 2002
The purpose of this paper is to survey the algorithms that compute the size of the elliptic curve group over finite fields. The techniques we describe range from naive ones which have exponential time complexity to sophisticated ones which run in polynomial time. We also present some computational results on the naive algorithms.R. Schoof, Counting points on elliptic curves over finite fields, Journal Theorie des Nombres de Bordeaux, vol. 7, 1995, pp. 219-254.
M. Fouquet, P. Gaudry, and R. Harley, An extension of Satoh's algorithm and its implementation, J. Ramanujan Math. Soc., 15:281-318, 2000.
M. Fouquet, P. Gaudry and R. Harley, Finding secure curves with the Satoh-FGH algorithm and an early-abort strategy, Advances in Cryptology, Eurocrypt 2001, Springer-Verlag, LNCS 2045, 14-29, 2001.
Frederik Vercauteren, Bart Preneel, Joos Vandewalle, A Memory Efficient Version of Satoh's Algorithm, Advances in Cryptology, Eurocrypt 2001, Lecture Notes in Computer Science 2045, Springer, 2001.
Kristian Gjosteen, Schoof's algorithm, preprint, 2000.
Antonia W. Bluher, A Leisurely Introduction to Formal Groups and Elliptic Curves, preprint.
Pierrick Gaudry, Algorithms for counting points on curves, presentation, ECC 2001.
Ian F. Blake, Gadiel Seroussi, and Nigel P. Smart, Elliptic Curves in Cryptography, Cambridge University Press, Cambridge, 1999.
Andreas Enge, Elliptic Curves and Their Applications to Cryptography - An Introduction, Kluwer Academic Publishers, 1999.
Silverman, J. H., The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics, Springer-Verlag, 1986.
Cohen, Henri, A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics, Springer-Verlag, 1993.
Cohen, Henri et al, User's Guide to PARI/GP, 2000.