An extension of kedlaya’s algorithm to artin-schreier curves in characteristic 2

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

Volumn 2369, Issue , 2002, Pages 308-323

  Denef, Jan ^a   Vercauteren, Frederik ^a,b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Cryptography; Hyperelliptic curves; Kedlaya s algorithm; Lauder wan algorithm; Monsky washnitzer cohomology

Indexed keywords

CRYPTOGRAPHY; FINITE ELEMENT METHOD; GEOMETRY; NUMBER THEORY;

ARTIN-SCHREIER CURVE; CHARACTERISTIC 2; HYPER-ELLIPTIC CURVES; MONSKY-WASHNITZER COHOMOLOGY; S-ALGORITHMS; STORAGE SPACES; TIME AND SPACE COMPLEXITY; ZETA FUNCTION;

ALGORITHMS;

EID: 84958538797     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45455-1_25     Document Type: Conference Paper

References (29)

1. S. Arita. Algorithms for computations in jacobians of Cab curve and their application to discrete-log-based public key cryptosystems. In Proceedings of Conference on The Mathematics of Public Key Cryptography, Toronto, June 1999.
2. A.O.L. Atkin. The number of points on an elliptic curve modulo a prime. Series of e-mails to the NMBRTHRY mailing list, 1992.
3. I.F. Blake, G. Seroussi, and N.P. Smart. Elliptic curves in cryptography. Volume 265 of London Mathematical Society Lecture Note Series, 1999.
4. S. Bosch. A rigid analytic version of M. Artin’s theorem on analytic equations. Math. Ann., 255:395–404, 1981.
5. J. Denef and F. Vercauteren. An extension of Kedlaya’s algorithm to hyperelliptic curves in characteristic 2. Preprint, 2002.
6. N. Elkies. Elliptic and modular curves over finite fields and related computational issues. Computational Perspectives on Number Theory, pages 21–76, 1998.
7. R. Elkik. Solutions d’équations a coefficients dans un anneau henselien. Ann. Scient. Ec. Norm. Syp., 6(4):553–604, 1973.
8. M. Fouquet, P. Gaudry, and R. Harley. On Satoh’s algorithm and its implementation. J. Ramanujan Math. Soc., 15:281–318, 2000.
9. S. Galbraith, S. Paulus, and N. Smart. Arithmetic on superelliptic curves. Math. Comp., 71(237):393–405, 2002.
10. P. Gaudry and N. Gürel. An extension of Kedlaya’s algorithm for counting points on superelliptic curves. In Advances in Cryptology - ASIACRYPT 2001, Lecture Notes in Computer Science, 2001.
11. P. Gaudry and R. Harley. Countingp oints on hyperelliptic curves over finite fields. Bosma, Wieb (ed.), ANTS-IV, Lect. Notes Comput. Sci. 1838, 313-332, 2000.
12. K.S. Kedlaya. Countingp oints on hyperelliptic curves usingMonsky-W ashnitzer cohomology. Preprint 2001.
13. N. Koblitz. Elliptic curve cryptosystems. Math. Comp., 48:203–209, 1987.
14. N. Koblitz. Hyperelliptic cryptosystems. J. Cryptology, 1(3):139–150, 1989.
15. A.G.B. Lauder and D. Wan. Countingp oints on varieties over finite fields of small characteristic. Preprint 2001.
16. A.G.B. Lauder and D. Wan. Computingzeta functions of Artin-Schreier curves over finite fields. Preprint 2001.
17. R. Lercier. Algorithmique des courbes elliptiques dans les corps finis. PhD thesis, Laboratoire d’Informatique de l’école polytechnique (LIX), 1997.
18. V. Miller. Uses of elliptic curves in cryptography. Advances in Cryptology -ASIACRYPT’91, Lecture notes in Computer Science, 218:460–469, 1993.
19. P. Monsky and G. Washnitzer. Formal cohomology. I. Ann. of Math., 88:181–217, 1968.
20. P. Monsky. Formal cohomology. II: The cohomology sequence of a pair. Ann. Of Math., 88:218–238, 1968.
21. P. Monsky. Formal cohomology. III: Fixed point theorems. Ann. of Math., 93:315–343, 1971.
22. P. Monsky. p-adic analysis and zeta functions. Lectures in Mathematics, Department of Mathematics Kyoto University. 4. Tokyo, Japan, 1970.
23. J. Pila. Frobenius maps of abelian varieties and findingro ots of unity in finite fields. Math. Comp., 55(192):745–763, 1990.
24. B. Poonen. Computational aspects of curves of genus at least 2. Cohen, Henri (ed.), ANTS-II, Lect. Notes Comput. Sci. 1122, 283-306, 1996.
25. 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.
26. R. Schoof. Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp., 44:483–494, 1985.
27. B. Skjernaa. Satoh’s algorithm in characteristic 2. To appear in Math. Comp., 2000.
28. M. van der Put. The cohomology of Monsky and Washnitzer. Mém. Soc. Math. France, 23:33–60, 1986.
29. F. Vercauteren, B. Preneel, and J. Vandewalle. A memory efficient version of Satoh’s algorithm. In Advances in Cryptology - EUROCRYPT 2001, number 2045 in Lecture Notes in Computer Science, pages 1–13, 2001.