Counting points on Cab curves using Monsky-Washnitzer cohomology

Finite Fields and their Applications

Volumn 12, Issue 1, 2006, Pages 78-102

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

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Cab curves; Cryptography; Kedlaya's algorithm; Monsky Washnitzer cohomology; Zeta function

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; CRYPTOGRAPHY; FINITE DIFFERENCE METHOD; FUNCTIONS; POLYNOMIALS;

CAB CURVES; KEDLAYA'S ALGORITHM; MONSKY-WASHNITZER COHOMOLOGY; ZETA FUNCTIONS;

ALGORITHMS;

EID: 28444451233     PISSN: 10715797     EISSN: 10902465     Source Type: Journal    
DOI: 10.1016/j.ffa.2005.01.003     Document Type: Article

References (36)

1. L.M. Adleman, M.-D. Huang, Counting rational points on curves and abelian varieties over finite fields, in: H. Cohen (Ed.), Algorithmic Number Theory Symposium, Proceedings ANTS-II, Lecture Notes in Computer Science, vol. 1122, Springer, Berlin, 1996, pp. 1-16.
2. L.M. Adleman, and M.-D. Huang Counting points on curves and abelian varieties over finite fields J. Symbolic Comput. 32 3 2001 171 189
3. S. Bosch A rigid analytic version of M. Artin's theorem on analytic equations Math. Ann. 255 3 1981 395 404
4. B. Buchberger A theoretical basis for the reduction of polynomials to canonical forms ACM SIGSAM Bull. 10 3 1976 19 29
5. H. Cohen A Course in Computational Algebraic Number Theory 1993 Springer Berlin
6. J. Denef, F. Vercauteren, An extension of Kedlaya's algorithm to hyperelliptic curves in characteristic 2, J. Cryptology, February 2005, in press.
7. R. Elkik, Solutions d'équations à coefficients dans un anneau hensélien, Ann. Sci. École Norm. Sup. (4) 6 (1973) 553-603 (1974).
8. G. Frey, and H.-G. Rück A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves Math. Comput. 62 206 1994 865 874
9. W. Fulton Algebraic Curves. An Introduction to Algebraic Geometry 1969 W. A. Benjamin Inc. New York, Amsterdam
10. S.D. Galbraith, Supersingular curves in cryptography, in: C. Boyd (Ed.), Advances in Cryptology, Proceedings Asiacrypt 2001, Lecture Notes in Computer Science, vol. 2248, Springer, Berlin, 2001, pp. 495-513.
11. P. Gaudry, N. Gürel, An extension of Kedlaya's point-counting algorithm to superelliptic curves, in: C. Boyd (Ed.), Advances in Cryptology, Proceedings Asiacrypt 2001, Lecture Notes in Computer Science, vol. 2248, Springer, Berlin, 2001, pp. 80-494.
12. M.-D. Huang, and D. Ierardi Counting points on curves over finite fields J. Symbolic Comput. 25 1 1998 1 21
13. A.A. Karatsuba, and Y. Ofman Multiplication of multidigit numbers on automata Sov. Phys. Dokl. 7 1963 595 596
14. K.S. Kedlaya Counting points on hyperelliptic curves using Monsky-Washnitzer cohomology J. Ramanujan Math. Soc. 16 4 2001 323 338
15. N. Koblitz Elliptic curve cryptosystems Math. Comput. 48 177 1987 203 209
16. N. Koblitz Hyperelliptic cryptosystems J. Cryptology 1 3 1989 139 150
17. A. Lauder, D. Wan, Counting points on varieties over finite fields of small characteristic, in: J.P. Buhler, P. Stevenhagen (Eds.), Algorithmic Number Theory: Lattices, Number Fields, Curves and Cryptography, Vol. 44, Mathematical Sciences Research Institute Publications, Cambridge University Press.
18. A.G.B. Lauder, and D. Wan Computing zeta functions of Artin-Schreier curves over finite fields LMS J. Comput. Math. 5 2002 34 55 (electronic)
19. A.G.B. Lauder, D. Wan, Computing zeta functions of Artin-Schreier curves over finite fields II, special issue of the J. Complexity 20 (2004) 331-349.
20. F. Macaulay On some formulas in elimination Proc. London Math. Soc. 3 1902 3 27
21. ab curve, available at http://www. rmatsumoto.org/cab.ps.
22. A.J. Menezes, T. Okamoto, and S.A. Vanstone Reducing elliptic curve logarithms to logarithms in a finite field IEEE Trans. Inform. Theory 39 5 1993 1639 1646
23. J.-F. Mestre, Algorithmes pour compter des points en petite caractéristique en genre 1 and 2, available at http://www.math.univ- rennes1.fr/crypto/2001-02/mestre.ps.
24. V.S. Miller, Use of elliptic curves in cryptography, in: H.C. Williams (Ed.), Advances in Cryptology, Proceedings Crypto 1985, Lecture Notes in Computer Science, vol. 218, Springer, Berlin, 1986, pp. 417-426.
25. P. Monsky Formal cohomology. II. The cohomology sequence of a pair Ann. of Math. (2) 88 1968 218 238
26. P. Monsky p-Adic Analysis and Zeta Functions 1970 Kinokuniya Book-Store Co. Ltd. Tokyo
27. P. Monsky Formal cohomology. III. Fixed point theorems Ann. of Math. (2) 93 1971 315 343
28. P. Monsky, and G. Washnitzer Formal cohomology. I Ann. of Math. (2) 88 1968 181 217
29. J. Pila Frobenius maps of abelian varieties and finding roots of unity in finite fields Math. Comput. 55 192 1990 745 763
30. 2N, available at http://arxiv.org/abs/math. NT/0303072, 2003.
31. T. Satoh The canonical lift of an ordinary elliptic curve over a finite field and its point counting J. Ramanujan Math. Soc. 15 4 2000 247 270
32. R. Schoof Counting points on elliptic curves over finite fields J. Théor. Nombres Bordeaux 7 1 1995 219 254 Les Dix-huitièmes Journées Arithmétiques (Bordeaux, 1993)
33. A.L. Toom The complexity of a scheme of functional elements simulating the multiplication of integers Dokl. Akad. Nauk SSSR 150 1963 496 498
34. M. van der Put The cohomology of Monsky and Washnitzer Mém. Soc. Math. France (N.S.) 23 4 1986 33 59 Introductions aux cohomologies p-adiques (Luminy, 1984)
35. F. Vercauteren, Computing zeta functions of curves over finite fields, Ph.D. Thesis, Katholieke Universiteit Leuven, November 2003, available at http://www.cs.bris.ac.uk/~frederik/.
36. A. Weil Numbers of solutions of equations in finite fields Bull. Amer. Math. Soc. 55 1949 497 508