An extension of kedlaya’s point-counting algorithm to superelliptic curves

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

Volumn 2248, Issue , 2001, Pages 480-494

  Gaudry, Pierrick ^a   Gürel, Nicolas ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; SECURITY OF DATA;

FINITE FIELDS; HYPER-ELLIPTIC CURVES; POINT COUNTING; SUPERELLIPTIC CURVES;

CRYPTOGRAPHY;

EID: 84946847285     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45682-1_28     Document Type: Conference Paper

References (35)

1. L. M. Adleman, J. DeMarrais, and M.-D. Huang. A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields. In L. Adleman and M.-D. Huang, editors, ANTS-I, volume 877 of Lecture Notes in Comput. Sci., pages 28–40. Springer- Verlag, 1994.
2. 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 12–17, 1999.
3. S. Arita. Construction of secure Cab curves usingmo dular curves. In W. Bosma, editor, ANTS-IV, volume 1838 of Lecture Notes in Comput. Sci., pages 113–126. Springer-Verlag, 2000.
4. S. Arita. Gaudry’s variant against Cab curve. In H. Imai and Y. Zheng, editors, Public Key Cryptography, volume 1751 of Lecture Notes in Comput. Sci., pages 58–67. Springer-Verlag, 2000.
5. S. Arita. Weil descent of elliptic curves over finite fields of characteristic three. In T. Okamoto, editor, Advances in Cryptolgy – ASIACRYPT 2000, volume 1976 of Lecture Notes in Comput. Sci., pages 248–258. Springer-Verlag, 2000.
6. A. Basiri, A. Enge, J.-C. Faugère, and N. Gürel. Fast arithmetic on superelliptic cubics. In preparation.
7. I. Blake, G. Seroussi, and N. Smart. Elliptic curves in cryptography, volume 265 of London Math. Soc. Lecture Note Ser. Cambridge University Press, 1999.
8. I. Duursma, P. Gaudry, and F. Morain. Speedingup the discrete logcomputation on curves with automorphisms. In K.Y. Lam, E. Okamoto, and C. Xing, editors, Advances in Cryptology – ASIACRYPT’99, volume 1716 of Lecture Notes in Comput. Sci., pages 103–121. Springer-Verlag, 1999.
9. M. Fouquet, P. Gaudry, and R. Harley. An extension of Satoh’s algorithm and its implementation. J. Ramanujan Math. Soc., 15:281–318, 2000.
10. M. Fouquet, P. Gaudry, and R. Harley. Findingsecure curves with the Satoh- FGH algorithm and an early-abort strategy. In B. Pfitzmann, editor, Advances in Cryptology – EUROCRYPT 2001, volume 2045 of Lecture Notes in Comput. Sci., pages 14–29. Springer-Verlag, 2001.
11. G. Frey and H.-G. Rück. A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comp., 62(206):865–874, April 1994.
12. W. Fulton. Algebraic curves. Math. Lec. Note Series. W. A. Benjamin Inc, 1969.
13. S. Galbraith, S. Paulus, and N. Smart. Arithmetic on superelliptic curves. To appear Math. Comp.
14. P. Gaudry. An algorithm for solvingthe discrete logproblem on hyperelliptic curves. In B. Preneel, editor, Advances in Cryptology – EUROCRYPT 2000, volume 1807 of Lecture Notes in Comput. Sci., pages 19–34. Springer-Verlag, 2000.
15. P. Gaudry and R. Harley. Countingp oints 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.
16. P. Gaudry, F. Hess, and N. Smart. Constructive and destructive facets of Weil descent on elliptic curves. To appear in J. Crypt.
17. R. Harasawa and J. Suzuki. Fast jacobian group arithmetic on Cab curves. In W. Bosma, editor, ANTS-IV, volume 1838 of Lecture Notes in Comput. Sci., pages 359–376. Springer-Verlag, 2000.
18. K. Kedlaya. Countingp oints on hyperelliptic curves usingMonsky-Washnitzer cohomology. Preprint, available at http://arXiv.org/abs/math/0105031, 2001.
19. N. Koblitz. p-adic numbers, p-adic analysis and Zeta-functions, volume 58 of Graduate Texts in Mathematics. Springer-Verlag, 1977.
20. N. Koblitz. p-adic analysis: a short course on recent work, volume 46 of London Math. Lec. Note Series. Cambridge University Press, 1980.
21. N. Koblitz. Elliptic curve cryptosystems. Math. Comp., 48(177):203–209, January 1987.
22. N. Koblitz. Hyperelliptic cryptosystems. J. of Cryptology, 1:139–150, 1989.
23. R. Lercier. Algorithmique des courbes elliptiques dans les corps finis. Thèse, École polytechnique, June 1997.
24. D. Lorenzini. An invitation to arithmetic geometry, volume 106 of Graduate Studies in Mathematics. AMS, 1993.
25. A. Menezes, T. Okamoto, and S. A. Vanstone. Reducingelliptic curves logarithms to logarithms in a finite field. In Proceedings 23rd Annual ACM Symposium on Theory of Computing (STOC), pages 80–89. ACM Press, 1991. May 6–8, New Orleans, Louisiana.
26. V. Miller. Use of elliptic curves in cryptography. In A. M. Odlyzko, editor, Advances in Cryptology – CRYPTO’86, volume 263 of Lecture Notes in Comput. Sci., pages 417–426. Springer-Verlag, 1987.
27. P. Monsky and G. Washnitzer. Formal cohomology: I. Ann. of Math. (2), 88:181–217, 1968.
28. P. Monsky. Formal cohomology: III. Ann. of Math. (2), 93:315–343, 1971.
29. J. Pila. Frobenius maps of abelian varieties and findingro ots of unity in finite fields. Math. Comp., 55(192):745–763, October 1990.
30. H. G. Rück. On the discrete logarithm in the divisor class group of curves. Math. Comp., 68(226):805–806, 1999.
31. T. Satoh. Asymptotically fast algorithm for computing the Frobenius substitution and norms over unramified extension of p-adic number fields. Preprint 2001.
32. 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.
33. B. Skjernaa. Satoh’s algorithm in characteristic 2. To appear in Math. Comp.
34. F. Vercauteren, B. Preneel, and J. Vandewalle. A memory efficient version of Satoh’s algorithm. In B. Pfitzmann, editor, Advances in Cryptology – EUROCRYPT 2001, volume 2045 of Lecture Notes in Comput. Sci., pages 1–13. Springer- Verlag, 2001.
35. N. Yui. On the jacobian varietes of hyperelliptic curves over fields of characteristic p >2. J. Algebra, 52:378–410, 1978.