Genus 2 point counting over prime fields

Journal of Symbolic Computation

Volumn 47, Issue 4, 2012, Pages 368-400

  Gaudry, Pierrick ^a   Schost, Éric ^b  

^a LORIA   (France)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Hyperelliptic curves; Point counting; Schoof Pila algorithm

Indexed keywords

EID: 84857368161     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2011.09.003     Document Type: Article

References (47)

1. Adleman L., Huang M.-D. Counting points on curves and abelian varieties over finite fields. Journal of Symbolic Computation 2001, 32:171-189.
2. Aho A., Steiglitz K., Ullman J.D. Evaluating polynomials at fixed sets of points. SIAM Journal on Computation 1975, 4(4):533-539.
3. Bernstein D.J. Curve25519: new Diffie-Hellman speed records. Lecture Notes in Comput. Sci. 2006, Vol. 3958:207-228. Springer-Verlag. M. Yung, Y. Dodis, A. Kiayias, T. Malkin (Eds.).
4. Bernstein, D.J., 2006b. Elliptic vs. hyperelliptic, part 1. Talk given at ECC 2006. Slides available at: http://cr.yp.to/talks.html#2006.09.20.
5. Bostan A., Flajolet P., Salvy B., Schost É Fast computation of special resultants. Journal of Symbolic Computation 2006, 41:1-29.
6. Bostan A., Schost É Polynomial evaluation and interpolation on special sets of points. Journal of Complexity 2005, 21(4):420-446.
7. Brent R.P., Kung H.T. Fast algorithms for manipulating formal power series. Journal of the Association for Computing Machinery 1978, 25(4):581-595.
8. Bröker R., Lauter K. Modular polynomials for genus 2. LMS Journal of Computation and Mathematics 2009, 12:326-339.
9. Pascal C., Schost E. Change of order for bivariate triangular sets. ISSAC'06 2006, 277-284. ACM.
10. Cantor D.G. On the analogue of the division polynomials for hyperelliptic curves. Journal für die Reine und Angewandte Mathematik 1994, 447:91-145.
11. Chambert-Loir, A., 2008. Compter (rapidement) le nombre de solutions d'équations dans les corps finis. Astérisque 317, 39-90, séminaire Bourbaki 968, novembre 2006.
12. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005, Chapman & Hall/CRC. H. Cohen, G. Frey (Eds.).
13. Couveignes, J.-M., Lercier, R., 2009. Fast construction of irreducible polynomials over finite fields. Eprint (submitted for publication). arxiv:0905.1642v2.
14. Dahan X., Schost É Sharp estimates for triangular sets. ISSAC'04 2004, 103-110. ACM.
15. Faugère, J.-C., Lubicz, D., Robert, D., 2009. Computing modular correspondences for abelian varieties, preprint. URL: http://hal.archives-ouvertes.fr/hal-00426338/en/.
16. Feo, L.D., 2010. Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic. Manuscript, arxiv:1002.2597.
17. Gathen J., Gerhard J. Modern Computer Algebra 1999, Cambridge University Press.
18. Gathen J., Shoup V. Computing Frobenius maps and factoring polynomials. Computational Complexity 1992, 2(3):187-224.
19. Gaudry, P., 2006. Algorithmes de comptage de points d'une courbe définie sur un corps fini. In: Méthodes explicites en théorie des nombres, Astérisque. (in press). http://www.loria.fr/~gaudry/publis/pano.pdf.
20. Gaudry P. Fast genus 2 arithmetic based on Theta functions. Journal of Mathematical Cryptology 2007, 1:243-265.
21. Gaudry P., Harley R. Counting points on hyperelliptic curves over finite fields. Lecture Notes in Comput. Sci. 2000, Vol. 1838:313-332. Springer-Verlag. B. W. (Ed.).
22. Gaudry P., Schost É Construction of secure random curves of genus 2 over prime fields. Lecture Notes in Computer Science. 2004, Vol. 3027:239-256. Springer.
23. Gaudry P., Schost É A low-memory parallel version of Matsuo, Chao and Tsujii's algorithm. Lecture Notes in Computer Science. 2004, 3076:208-222. Springer.
24. Gaudry P., Schost É Modular equations for hyperelliptic curves. Mathematics of Computation 2005, 74:429-454.
25. Gaudry P., Thomé E. The mpFq library and implementing curve-based key exchanges. SPEED: Software Performance Enhancement for Encryption and Decryption 2007, 49-64.
26. Harvey D. Kedlaya's algorithm in larger characteristic. International Mathematics Research Notices 2007, 2007. Article ID rnm095, 29 pages.
27. Huang M.-D., Ierardi D. Counting points on curves over finite fields. Journal of Symbolic Computation 1998, 25:1-21.
28. Kaltofen E., Shoup V. Fast polynomial factorization over high algebraic extensions of finite fields. ISSAC'97 1997, 184-188. ACM.
29. Kedlaya K.S. Counting points on hyperelliptic curves using Monsky-Washnitzer cohomology. Journal of the Ramanujan Mathematical Society 2001, 16(4):323-338.
30. Kedlaya K.S., Umans C. Fast modular composition in any characteristic. FOCS. IEEE 2008, 146-155.
31. Lange T. Formulae for arithmetic on genus 2 hyperelliptic curves. Applicable Algebra in Engineering, Communication and Computing 2005, 15(5):295-328.
32. Lauder A. Deformation theory and the computation of zeta functions. Proceedings of the London Mathematical Society 2004, 88:565-602.
33. Lenstra H.W., Pila J., Pomerance C. A hyperelliptic smoothness test,~II. Proceedings of the London Mathematical Society 2002, 84:105-146.
34. Lercier, R., 1997. Algorithmique des courbes elliptiques dans les corps finis. Thèse, École polytechnique.
35. Lubicz, D., Robert, D., 2010. Computing isogenies between Abelian varieties, preprint, 48 pages. URL: http://hal.archives-ouvertes.fr/hal-00446062/en/.
36. Matsuo K., Chao J., Tsujii S. An improved baby step giant step algorithm for point counting of hyperelliptic curves over finite fields. Lecture Notes in Comput. Sci. 2002, Vol. 2369:461-474. Springer-Verlag. C. Fiecker, D. Kohel (Eds.).
37. Pila J. Frobenius maps of abelian varieties and finding roots of unity in finite fields. Mathematics of Computation 1990, 55(192):745-763.
38. Pitcher, N., 2009. Efficient point-counting on genus-2 hyperelliptic curves. Ph.D. thesis, University of Illinois at Chicago.
39. Reischert D. Asymptotically fast computation of subresultants. ISSAC'97 1997, 233-240. ACM.
40. Rouillier F. Solving zero-dimensional systems through the Rational Univariate Representation. Applicable Algebra in Engineering, Communication and Computing 1999, 9(5):433-461.
41. 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:247-270.
42. Shoup V. Fast construction of irreducible polynomials over finite fields. Journal of Symbolic Computation 1994, 17(5):371-391.
43. Shoup V. A new polynomial factorization algorithm and its implementation. Journal of Symbolic Computation 1995, 20(4):363-397.
44. Shoup, V., 1996-2010. NTL: a library for doing number theory. http://www.shoup.net.
45. Streng, M., 2010. Complex multiplication of abelian surfaces. Ph.D. thesis, Universiteit Leiden.
46. Sutherland A.V. A generic approach to searching for Jacobians. Mathematics of Computation 2009, 78:485-507.
47. Trager B.M. Algebraic factoring and rational function integration. SYMSAC 76 1976, 219-226. ACM.