Skip Navigation

International Mathematics Research Papers (2006) Vol. 2006 : article ID 72017, 57 pages, doi:10.1155/IMRP/2006/72017
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow How to cite this article
Google Scholar
Right arrow Articles by Castryck, W.
Right arrow Articles by Vercauteren, F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2006 Hindawi Publishing Corporation. All rights reserved.

Computing zeta functions of nondegenerate curves

W. Castryck, J. Denef and F. Vercauteren

Department of Mathematics, University of Leuven Celestijnenlaan 200B, B-3001 Leuven-Heverlee, Belgium E-mail address: wouter.castryck{at}wis.kuleuven.be
Department of Mathematics, University of Leuven Celestijnenlaan 200B, B-3001 Leuven-Heverlee, Belgium E-mail address: jan.denef{at}wis.kuleuven.be
Department of Electrical Engineering, University of Leuven Kasteelpark Arenberg 10, B-3001 Leuven-Heverlee, Belgium E-mail address: frederik.vercauteren{at}esat.kuleuven.be

We present a p-adic algorithm to compute the zeta function of a nondegenerate curve over a finite field using Monsky-Washnitzer cohomology. The paper vastly generalizes previous work since in practice all known cases, for example, hyperelliptic, superelliptic, and Cab curves, can be transformed to fit the nondegenerate case. For curves with a fixed Newton polytope, the property of being nondegenerate is generic, so that the algorithm works for almost all curves with given Newton polytope. For a genus g curve over Fpn, the expected running time is Õ(n3g6 + n2g6.5), whereas the space complexity amounts to Õ(n3g4), assuming p is fixed.



References

  1. Aschenbrenner M. Ideal membership in polynomial rings over the integers. Journal of the American Mathematical Society (2004) 17(2):407–441.[CrossRef][Web of Science]
  2. Batyrev Victor V. Variations of the mixed Hodge structure of affine hypersurfaces in algebraic tori. Duke Math. J. (1993) 69(2):349–409.[CrossRef]
  3. Beelen P., Pellikaan R. The Newton polygon of plane curves with many rational points. Designs, Codes and Cryptography (2000) 21(1–3):41–67.[CrossRef][Web of Science]
  4. Castryck W. Point counting on nondegenerate curves. Ph.D. thesis KULeuven 2006, http://wis.kuleuven.be./algebra/artikles/thesis_wouter.pdf.
  5. Cohen H. A Course in Computational Algebraic Number Theory. In: Graduate Texts in Mathematics (1993) 138. Berlin: Springer. xii+534.
  6. Cohen H., Frey G., Avanzi R., Doche C., Lange T., Nguyen K., Vercauteren F., eds. Handbook of Elliptic and Hyperelliptic Curve Cryptography. In: Discrete Mathematics and Its Applications (Boca Raton) (2006) Florida: Chapman & Hall/CRC. xxxiv+808.
  7. Cox D., Little J., O'Shea D. Ideals, Varieties, and Algorithms. In: Undergraduate Texts in Mathematics (1992) New York: Springer. xii+513.
  8. Danilov V. I. The geometry of toric varieties. Russian Mathematical Surveys (1978) 33(2):97–154.
  9. Denef J., Vercauteren F. An extension of Kedlaya's algorithm to hyperelliptic curves in characteristic 2. Journal of Cryptology (2006) 19(1):1–25. errata: http://www.wis.kuleuven.be/algebra/denef_papers/erratapointcounting.pdf.[CrossRef][Web of Science]
  10. Denef J., Vercauteren F. Counting points on Cab curves using Monsky-Washnitzer cohomology. Finite Fields and Their Applications (2006) 12(1):78–102. errata: http://www.wis.kuleuven.be/algebra/denef_papers/erratapointcounting.pdf.[CrossRef][Web of Science]
  11. Dwork B. On the rationality of the zeta function of an algebraic variety. American Journal of Mathematics (1960) 82(3):631–648.[CrossRef][Web of Science]
  12. Dwork B. A deformation theory for the zeta function of a hypersurface. (1963) Proceedings of the International Congress of Mathematicians, 1962: Stockholm. Djursholm: Inst. Mittag-Leffler. 247–259.
  13. Edixhoven B. Point counting after Kedlaya. notes of a EIDMA-Stieltjes Graduate course given in Leiden, 2003.
  14. Ehrhart E. Sur un problème de géométrie diophantienne linéaire. I. Polyèdres et réseaux. Journal für die Reine und Angewandte Mathematik (1967) 226:1–29.[Web of Science]
  15. Elkies N. D., Howe E. W., Kresch A., Poonen B., Wetherell J. L., Zieve M. E. Curves of every genus with many points, II: asymptotically good families. Duke Mathematical Journal (2004) 122(2):399–422.[CrossRef][Web of Science]
  16. Gaudry P. Counting points on genus 2 curves over finite fields. slides of a talk given at Durham, 2000, http://www.lix.polytechnique.fr/Labo/Pierrick.Gaudry/papers.en.html.
  17. Gaudry P., Gürel N. An extension of Kedlaya's point-counting algorithm to superelliptic curves. In: Advances in Cryptology—ASIACRYPT 2001 (Gold Coast) (2001) 2248. Berlin: Springer. 480–494. Lecture Notes in Comput. Sci.
  18. Gerkmann R. Relative rigid cohomology and point counting on families of elliptic curves. preprint, 2005.
  19. Grünbaum B., Shephard G. C. Pick's theorem. The American Mathematical Monthly (1993) 100(2):150–161.[CrossRef]
  20. Hovanskii A. G. Newton polyhedra, and the genus of complete intersections. Funktsional'nyi Analiz i ego Prilozheniya (1978) 12(1):51–61. English translation in Functional Analysis and Its Applications 12 (1978), 38–46.
  21. Huang M.-D., Ierardi D. Counting points on curves over finite fields. Journal of Symbolic Computation (1998) 25(1):1–21.[CrossRef][Web of Science]
  22. Huang M.-D., Wong Y.-C. An algorithm for approximate counting of points on algebraic sets over finite fields. In: Lecture Notes in Comput. Sci. (1998) 1423. Algorithmic Number Theory, 1998: Portland, Ore. Berlin: Springer. 514–527.
  23. Hubrechts H. Memory efficient hyperelliptic curve point counting. preprint, 2006.
  24. Katz N. M., Sarnak P. Random Matrices, Frobenius Eigenvalues, and Monodromy. In: American Mathematical Society Colloquium Publications (1999) 45. Rhode Island: American Mathematical Society. xii+419.
  25. Kedlaya K. S. Counting points on hyperelliptic curves using Monsky-Washnitzer cohomology. Journal of the Ramanujan Mathematical Society (2001) 16(4):323–338.
  26. Kedlaya K. S. Computing zeta functions via p-adic cohomology. In: Algorithmic Number Theory (2004) 3076. Berlin: Springer. 1–17. Lecture Notes in Comput. Sci.
  27. Kedlaya K. Computing zeta functions of nondegenerate toric hypersurfaces. draft.
  28. Kollár J. Sharp effective Nullstellensatz. Journal of the American Mathematical Society (1988) 1(4):963–975.[CrossRef]
  29. Kushnirenko A. G. Newton polytopes and the Bezout theorem. Functional Analysis and Its Applications (1976) 10(3):233–235.[CrossRef]
  30. Lauder A. G. B. Counting solutions to equations in many variables over finite fields. Foundations of Computational Mathematics (2004) 4(3):221–267.[Web of Science]
  31. Lauder A. G. B. Deformation theory and the computation of zeta functions. Proceedings of the London Mathematical Society. Third Series (2004) 88(3):565–602.
  32. Lercier R., Lubicz D. A quasi quadratic time algorithm for hyperelliptic curve point counting. to appear in Ramanujan Journal.
  33. Mestre J.-F. Algorithmes pour compter des points de courbes en petite charactéristique et en petit genre. notes of a talk given at Rennes, 2000, http://www.math.jussieu.fr/~mestre/.
  34. Monsky P. Formal cohomology. II. The cohomology sequence of a pair. Annals of Mathematics. Second Series (1968) 88(2):218–238.
  35. Monsky P. Formal cohomology. III. Fixed point theorems. Annals of Mathematics. Second Series (1971) 93(2):315–343.
  36. Monsky P., Washnitzer G. Formal cohomology. I. Annals of Mathematics. Second Series (1968) 88:181–217.
  37. Pila J. Frobenius maps of abelian varieties and finding roots of unity in finite fields. Mathematics of Computation (1990) 55(192):745–763.[CrossRef][Web of Science]
  38. Poonen B. Computational aspects of curves of genus at least 2. In: Lecture Notes in Comput. Sci. (1996) 1122. Algorithmic Number Theory, 1996: Talence. Berlin: Springer. 283–306.
  39. Ritzenthaler C. Point counting on genus 3 non hyperelliptic curves. In: Algorithmic Number Theory (2004) 3076. Berlin: Springer. 379–394. Lecture Notes in Comput. Sci.
  40. Satoh T. The canonical lift of an ordinary elliptic curve over a finite field and its point counting. Journal of the Ramanujan Mathematical Society (2000) 15(4):247–270.
  41. Schoof R. Counting points on elliptic curves over finite fields. Journal de Théorie des Nombres de Bordeaux (1995) 7(1):219–254.
  42. Scott P. R. On convex lattice polygons. Bulletin of the Australian Mathematical Society (1976) 15(3):395–399.
  43. Tsuzuki N. Bessel F-isocrystals and an algorithm for computing Kloosterman sums. preprint, 2003.
  44. van der Put M. The cohomology of Monsky and Washnitzer. Mémoires de la Société Mathématique de France. Nouvelle Série (1986) 23:33–59. D. Barsky, and P. Robba (eds.), Introductions aux Cohomologies p-Adiques (Luminy, 1984).
  45. Vercauteren F. Computing zeta functions of curves over finite fields (2003) Leuven: Katholieke Universiteit Leuven.
  46. von zur Gathen J., Gerhard J. Modern Computer Algebra (1999) New York: Cambridge University Press. xiv+753.

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow How to cite this article
Google Scholar
Right arrow Articles by Castryck, W.
Right arrow Articles by Vercauteren, F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?