Counting points on elliptic curves over finite fields of small characteristic in quasi quadratic time

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

Volumn 2656, Issue , 2003, Pages 360-373

  Lercier, Reynald ^a   Lubicz, David ^a  

^a CELAR   (France)

Author keywords

AGM; Canonical lifts; Elliptic curves

Indexed keywords

ALGORITHMS;

AGM; BIT-OPERATIONS; ELLIPTIC CURVE; ELLIPTIC CURVES OVER FINITE FIELDS; GAUSSIAN NORMAL BASIS; QUADRATIC TIME; SPACE COMPLEXITY; TIME COMPLEXITY;

GEOMETRY;

EID: 35248815538     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39200-9_22     Document Type: Article

References (18)

1. R. P. Brent and H. T. Kung. Fast algorithms for manipulating formal power series. Journal of the ACM, 25:581-595, 1978.
2. ∼zen/.
3. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, May 1987. New York City.
4. Free Software Foundation. GNU MP Library. Available at http://www.swox.com/gmp/.
5. Pierrick Gaudry. A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2. In Advances in Cryptology-ASIACRYPT 2002, volume 2501 of Lecture Notes in Computer Science, pages 311-327. Springer-Verlag, December 2002.
6. Robert Harley. Asymptotically optimal p-adic point-counting. Email at the Number Theory List, December 2002.
7. Hae Young Kim, Jung Youl Park, Jung Hee Cheon, Je Hong Park, Jae Heon Kim, and Sang Ceun Hahn. Fast Elliptic Curve Point Counting Using Gaussian Normal Basis. In Claus Fieker and David R. Kohel, editors, Algorithmic Number Theory, 5th International Symposium, ANTS-V, volume 2369 of Lecture Notes in Computer Science, pages 292-307. Springer-Verlag, July 2002.
8. Serge Lang. Algebra (3rd revised edition), volume 211 of Graduate Texts in Mathematics. Springer-Verlag, 2002.
9. Alfred J. Menezes, Ian F. Blake, XuHong Gao, Ronald C. Mullin, Scott A. Vanstone, and Tomik Yaghoobian. Applications of finite fields. The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, 1993.
10. ∼mestre, 2001.
11. Jean-François Mestre. Notes of a talk given at the seminar of cryptography of Rennes. Available at http://www.maths.univ-rennes1.fr/crypto/, 2002.
12. T. Satoh, B. Skjernaa, and Y. Taguchi. Fast Computation of Canonical Lifts of Elliptic Curves and its Application to Point Counting, August 2001. Preprint.
13. Takakazu Satoh. The canonical lift of an ordinary elliptic curve over a finite field and its point counting. J. Ramanujan Math. Soc., 15(4):247-270, 2000.
14. Takakazu Satoh. On p-adic Point Counting Algorithms for Elliptic Curves over Finite Fields. In Claus Fieker and David R. Kohel, editors, Algorithmic Number Theory, 5th International Symposium, ANTS-V, pages 43-66. Springer-Verlag, July 2002.
15. R. Schoof. Counting points on elliptic curves over finite fields. J. Théorie des nombres de Bordeaux, 7:483-494, 1998.
16. V. Strassen. Gaussian Elimination is Not Optimal. Numerische Mathematik, 13:354-356, 1969.
17. F. Vercauteren. On AGM. Personal communication, November 2002.
18. Frederik Vercauteren, Bart Preneel, and Joos Vandewalle. A Memory Efficient Version of Satoh's Algorithm. In Advances in Cryptology - EUROCRYPT 2001 (Innsbruck), volume 2045 of Lecture Notes in Computer Science, pages 1-13. Springer-Verlag, 2001.