Construction of secure random curves of genus 2 over prime fields

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

Volumn 3027, Issue , 2004, Pages 239-256

  Gaudry, Pierrick ^a   Schost, Éric ^b  

^a ÉCOLE POLYTECHNIQUE   (France)

^b ECOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

GENUS 2 CURVES; JACOBIANS; PRIME FIELD; S-ALGORITHMS;

ALGORITHMS;

EID: 35048820123     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24676-3_15     Document Type: Article

References (34)

1. L. Adleman and M.-D. Huang. Counting points on curves and abelian varieties over finite fields. J. Symbolic Comput., 32:171-189, 2001.
2. A. Aho, K. Steiglitz, and J. D. Ullman. Evaluating polynomials at fixed sets of points. SIAM J. Comput., 4(4):533-539, 1975.
3. W. Bosma and J. Cannon. Handbook of Magma functions, 1997. http://www.maths.usyd.edu.au:8000/u/magma/.
4. A. Bostan, P. Flajolet, B. Salvy, and É. Sehost. Fast computation with two algebraic numbers. Technical Report 4579, INRIA, 2002.
5. A. Bostan, P. Gaudry, and E. Schost. Linear recurrences with polynomial coefficients and computation of the Cartier-Manin operator on hyperelliptic curves. 2003. To appear in Proceedings Fq'7.
6. R. Brent and H. Kung. Fast algorithms for manipulating formal power series. J. ACM, 25:581-595, 1978.
7. D. G. Cantor. Computing in the Jacobian of an hyperelliptic curve. Math. Comp., 48(177):95-101, 1987.
8. D. G. Cantor. On the analogue of the division polynomials for hyperelliptic curves. J. Reine Angew. Math., 447:91-145, 1994.
9. P. Gaudry. NTLJac2, Tools for genus 2 Jacobians in NTL. http://www.lix.polytechnique.fr/Labo/Pierrick.Gaudry/NTLJac2/.
10. P. Gaudry and N. Gürel. Counting points in medium characteristic using Kedlaya's algorithm. To appear in Experiment. Math.
11. P. Gaudry and R. Harley. Counting points on hyperelliptic curves over finite fields. In W. Bosma, editor, ANTS-IV, volume 1838 of Lecture Notes in Comput. Sci., pages 313-332. Springer-Verlag, 2000.
12. P. Gaudry and É. Schost. Modular equations for hyperelliptic curves. To appear in Math. Comp.
13. P. Gaudry and Eric Schost. A low-memory parallel version of Matsuo, Chao and Tsujii's algorithm. To appear in ANTS VI.
14. G. Hanrot and F. Morain. Solvability of radicals from an algorithmic point of view. In ISSAC'0l, pages 175-182. ACM Press, 2001.
15. M. Hindry and J. Silverman. Diophantine geometry. An introduction, volume 201 of Graduate Texts in Mathematics. Springer-Verlag, 2000.
16. M.-D. Huang and D. lerardi. Counting points on curves over finite fields. J. Symbolic Comput, 25:1-21, 1998.
17. E. Kaltofen and V. Shoup. Fast polynomial factorization over high algebraic extensions of finite fields. In W. Kuchlin, editor, ISSAC-97, pages 184-188. ACM Press, 1997.
18. W. Kampkötter. Explizite Gleichungen für Jacobische Varietäten hyperelliptischer Kurven. PhD thesis, Universität Gesamthochschule Essen, August 1991.
19. T. Lange. Formulae for arithmetic on genus 2 hyperelliptic curves, 2003. Preprint.
20. R. Lercier and D. Lubicz. A quasi quadratic time algorithm for hyperelliptic curve point counting. Preprint.
21. K. Matsuo, J. Chao, and S. Tsujii. An improved baby step giant step algorithm for point counting of hyperelliptic curves over finite fields. In C. Fiecker and D. Kohel, editors, ANTS-V, volume 2369 of Lecture Notes in Comput. Sci., pages 461-474. Springer-Verlag, 2002.
22. A. Menezes, Y.-H. Wu, and R. Zuccherato. An elementary introduction to hyperelliptic curves. In Algebraic aspects of cryptography, by N. Koblitz, pages 155-178, Springer-Verlag, 1997.
23. 2n). Letter to Gaudry and Harley, December 2000.
24. J. S. Milne. Abelian varieties. In G. Cornell and J. H. Silverman, editors, Arithmetic Geometry, pages 103-150. Springer-Verlag, 1986.
25. J. Pelzl, T. Wollinger, J. Guajardo, and C. Paar. Hyperelliptic curve cryptosystems: Closing the performance gap to elliptic curves. Preprint, 2003.
26. J. Pila. Frobenius maps of abelian varieties and finding roots of unity in finite fields. Math. Comp., 55 (192):745-763, October 1990.
27. R. Schoof. Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp., 44:483-494, 1985.
28. É. Schost. Complexity results for triangular sets. J. Symbolic Comput., 36:555-594, 2003.
29. V. Shoup. NTL: A library for doing number theory. http://www.shoup.net/ ntl/.
30. V. Shoup. A new polynomial factorization algorithm and its implementation. J. Symbolic Comput, 20:363-397, 1995.
31. F. Vercauteren. Computing Zeta functions of hyperelliptic curves over finite fields of characteristic 2. In M. Yung, editor, Advances in Cryptology - CRYPTO 2002, volume 2442 of Lecture Notes in Comput. Sci., pages 369-384. Springer-Verlag, 2002.
32. J. von zur Gathen and J. Gerhard. Modern computer algebra. Cambridge University Press, 1999.
33. J. von zur Gathen and V. Shoup. Computing Frobenius maps and factoring polynomials. Comput. Complexity, 2:187-224, 1992.
34. A. Weng. Constructing hyperelliptic curves of genus 2 suitable for cryptography. Math. Comp., 72:435-458, 2003.