Counting Points in Medium Characteristic Using Kedlaya’s Algorithm

Experimental Mathematics

Volumn 12, Issue 4, 2003, Pages 395-402

  Gaudry, Pierrick ^a   Gürel, Nicolas ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Cryptography; Hyperelliptic curves; Kedlaya s algorithm; Point counting

Indexed keywords

EID: 2442566833     PISSN: 10586458     EISSN: 1944950X     Source Type: Journal    
DOI: 10.1080/10586458.2003.10504508     Document Type: Article

References (29)

1. L. Adleman and M.-D. Huang. "Counting Points on Curves and Abelian Varieties over Finite Fields." J. Symbolic Comput. 32 (2001), 171-189.
2. D. Bailey and C. Paar. "Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms." In Advances in Cryptology-CRYPTO '98, Lecture Notes in Comput. Sci., 1462, pp. 472-485. Berlin: Springer-Verlag, 1998.
3. A. Bostan, P. Gaudry, and É. Schost. "Linear Recurrence with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves." To appear in Proceedings of the Seventh International Conference on Finite Fields and Applications Fq7, 2003.
4. J. M. Couveignes. "Computing l-Isogenies V sing the p- Torsion." In Algorithmic Number Theory, Lecture Notes in Comput. Sci., 1122, pp. 59-65. Berlin: Springer-Verlag, 1996.
5. J. Denef and F. Vercauteren. "An Extension of Kedlaya's Algorithm to Artin-Schreier Curves in Characteristic 2." In Algorithmic Number Theory, Lecture Notes in Comput. Sci., 2369, pp. 308-323. Berlin: Springer-Verlag, 2002.
6. M. Fouquet, P. Gaudry, and R. Harley. "An Extension of Satoh's Algorithm and its Implementation. " J. Ramanujan Math. Soc. 15 (2000), 281-318.
7. M. Fouquet, P. Gaudry, and R. Harley. "Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy." In Advances in Cryptology-EUROCRYPT 2001, Lecture Notes in Comput. Sci., 2045, pp. 14-29. Berlin: Springer-Verlag, 2001.
8. P. Gaüdry. "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, Lecture Notes in Comput. Sci., 2501, pp. 311-327. Berlin: Springer-Verlag, 2002.
9. P. Gaüdry and N. Gürel. "An Extension of Kedlaya's Point Counting Algorithm to Superelliptic Curves." In Advances in CryptologyASIACRYPT 2001, Lecture Notes in Comput. Sci., 2248, pp. 4780-494. Berlin: Springer-Verlag, 2001.
10. P. Gaudry and R. Harley. "Count ing Points on Hyperelliptic Curves over Finite Fields." In Algorithmic Number Theory, Lecture Notes in Comput. Sci., 1838, pp. 313-332. Berlin: Springer-Verlag, 2000.
11. 24 + 41)." Email to the NMBRTHRY list, September 2002.
12. T. Granlund. The GNU Multiple Precision Arithmetic Library-4.1. Swox AB, 2002. Distributed at http://swox.com/gmp/.
13. R. Harley. "Ellipt ic Ccurve Point Counting: 32003 Bits." Email to the NMBRTHRY list, August 2002.
14. K. Kedlaya. "Count ing Points on Hyperelliptic Curves Using Monsky-Washnitzer Cohomology." J. Ramanujan Math. Soc. 16 (2001), 323-338.
15. N. Koblitz. p-Adic Numbers, p-Adic Analysis and Zeta-Functions, GTM, Vol. 58. New York Heidelberg: Springer-Verlag, 1977.
16. A. Lauder. "Computing Zeta Functions of Kummer Curvesvia Multiplicative Characters." Foundations of Computational Mathematics 3: 3 (2003), 273-295.
17. A. Lauder and D. Wan. "Counting Points on Varieties over Finite Fields of Small Characteristic. " Preprint, 2001.
18. J.-F. Mestre. "Utilisation de l'AGM pour lecalcul de E(Formula Presented). " Lettre adressee a Gaudryet Harley. Available in French at http: //www.math.jussieu.fr/-mestre/, December 2000
19. J. Pila. "Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields. " Math. Compo 55: 192 (1990), 745-763.
20. T. Satoh. "T he Canonical Lift of an Ordinary Elliptic Curve over a Finite Field and Its Point Counting." J. Ramanujan Math. Soc. 15 (2000),247-270.
21. T. Satoh. "On p-Adic Point Counting Algorithms for Elliptic Curves over Finite Fields." In Algorithmic Number Theory, Lecture Notes in Comput. Sci., 2369, pp. 43-66. Berlin: Springer-Verlag, 2002.
22. T. Satoh, B. Skjernaa, and Y. Taguchi. "Fast Computation of Canonical Lifts of Elliptic Curves and Its Application to Point Counting." Finite Fields and Their Applications 9: 1 (2003), 89-101.
23. R. Schoof. "Counting Points on Elliptic Curves over Finite Fields." J. Theor. Nombres Bordeaux 7 (1995), 219-254.
24. V. Shoup. NTL: A Library for Doing Number Theory. Available from World Wide Web (http://www.shoup.net/ntl/), 2002.
25. Berit Skjernaa. "Satoh's Algorithm in Characteristic 2." Math. Compo 72 (2003), 477-487.
26. M. van der Put. "T he Cohomology of Monsky and Washnitzer." Mem. Soc. Math. France 23 (1986), 33-60.
27. F. Vercauteren. "Comput ing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2." In Advances in Cryptology-CRYPTO 2002, Lecture Notes in Comput. Sci., 2442, pp. 369-384. Berlin: Springer-Verlag, 2002.
28. F. Vercauteren, B. Preneel, and J. Vandewalle. "A Memory Efficient Version of Satoh's Algorithm." In Advances in Cryptology-EUROCRYPT 2001, Lecture Notes in Comput. Sci., 2045, pp. 1-13. Berlin: Springer-Verlag, 2001.
29. J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge, UK: Cambridge University Press, 1999