A comparison and a combination of sst and agm algorithms for counting points of elliptic curves in characteristic 2

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

Volumn 2501, Issue , 2002, Pages 311-327

  Gaudry, Pierrick ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; GEOMETRY; SECURITY OF DATA;

ASYMPTOTIC COMPLEXITY; CHARACTERISTIC 2; ELLIPTIC CURVE; P-ADIC METHODS;

ALGORITHMS;

EID: 84958773354     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36178-2_20     Document Type: Conference Paper

References (14)

1. I. Blake, G. Seroussi, and N. Smart. Elliptic curves in cryptography, volume 265 of London Math. Soc. Lecture Note Ser. Cambridge University Press, 1999.
2. M. Fouquet, P. Gaudry, and R. Harley. An extension of Satoh’s algorithm and its implementation. J. Ramanujan Math. Soc., 15:281–318, 2000.
3. M. Fouquet, P. Gaudry, and R. Harley. Finding secure curves with the Satoh-FGH algorithm and an early-abort strategy. In B. Pfitzmann, editor, Advances in Cryptology – EUROCRYPT 2001, volume 2045 of Lecture Notes in Comput. Sci., pages 14–29. Springer-Verlag, 2001.
4. T. Granlund. The GNU Multiple Precision arithmetic library – 4.0.1. Swox AB, 2002. distributed at http://swox.com/gmp/.
5. R. Harley. Counting points with the arithmetic-geometric mean (joint work with J.-F. Mestre and P. Gaudry). Eurocrypt 2001, Rump session.
6. A. Karp and P. Markstein. High precision division and square root. Technical Report 93-93-42, HP Labs, October 1994.
7. H. Kim, J. Park, J. Cheon, J. Park, J. Kim, and S. Hahn. Fast elliptic curve point counting using Gaussian normal basis. In C. Fieker and D. R. Kohel, editors, ANTS-V, volume 2369 of Lecture Notes in Comput. Sci., pages 292–307. Springer–Verlag, 2002.
8. T. Satoh. The canonical lift of an ordinary elliptic curve over a finite field and its point counting. J. Ramanujan Math. Soc., 15:247–270, 2000.
9. T. Satoh. On p-adic point counting algorithms for elliptic curves over finite fields. In C. Fieker and D. R. Kohel, editors, ANTS-V, volume 2369 of Lecture Notes in Comput. Sci., pages 43–66. Springer–Verlag, 2002.
10. T. Satoh, B. Skjernaa, and Y. Taguchi. Fast computation of canonical lifts of elliptic curves and its application to point counting. Preprint 2001.
11. R. Schoof. Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp., 44:483–494, 1985.
12. B. Skjernaa. Satoh’s algorithm in characteristic 2. To appear in Math. Comp.
13. F. Vercauteren, B. Preneel, and J. Vandewalle. A memory efficient version of Satoh’s algorithm. In B. Pfitzmann, editor, Advances in Cryptology – EUROCRYPT 2001, volume 2045 of Lecture Notes in Comput. Sci., pages 1–13. Springer-Verlag, 2001.
14. J. von zur Gathen and J. Gerhard. Modern computer algebra. Cambridge University Press, 1999.