Point counting on Picard curves in large characteristic

Mathematics of Computation

Volumn 74, Issue 252, 2005, Pages 1983-2005

  Bauer, Mark ^a   Teske, Edlyn ^b   Weng, Annegret ^c  

^a UNIVERSITY OF CALGARY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

^c JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

Picard curves

Indexed keywords

EID: 27144554147     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-05-01758-8     Document Type: Article

References (26)

1. [Bau04] M. Bauer. The arithmetic of certain cubic function fields. Mathematics of Computation, 73:387-413, 2004. MR2034129 (2004k:11179)
2. [BGS04] A. Bostan, P. Gaudry, and E. Schost. Linear recurrences with polynomial coefficients and computation of the Cartier-Manin operator on hyperelliptic curves. In Finite Fields and Applications Fq7, volume 2948 of Lecture Notes in Computer Science, pages 40-58. Springer-Verlag, 2004. MR2092621
3. [Bou00] I. Bouw. The p-rank of curves and covers of curves. In Courbes semi-stables et groupe fondamental en géomtrie algèbrique (Luminy, 1998), number 187 in Progr. Math., pages 267-277, Basel, 2000. MR1768105 (2001j:14042)
4. [DH76] W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22:644-654, 1976. MR0437208 (55:10141)
5. [ELW] K. Eisenträger, K. Lauter, and A. Weng. The ℓ-torsion points on the Jacobian of a Picard curve. In preparation.
6. [FO04] S. Flon and R. Oyono. Fast arithmetic on Jacobians on Picard curves. In Public Key Cryptography - PKC 2004, volume 2947 of Lecture Notes in Computer Science, pages 55-68. Springer-Verlag, 2004. MR2095638
7. [GG03] P. Gaudry and N. Gurel. Counting points in medium characteristic using Kedlaya's algorithm. Experimental Math. 12:395-402, 2003. MR2043990 (2005b:11084)
8. [GS04] P. Gaudry and E. Schost. A low-memory parallel version of Matsuo, Chao and Tsujii's algorithm. In Algorithmic Number Theory Symposium ANTS-VI, volume 3076 of Lecture Notes in Computer Science, pages 208-222. Springer-Verlag, 2004.
9. [GH78] P. Griffiths and J. Harris. Principles of algebraic geometry. Wiley-Interscience, New York, 1978. MR0507725 (80b:14001)
10. [KW] K. Koike and A. Weng. Construction of CM Picard curves. Mathematics of Computation, 74:499-518, 2005. MR2085904
11. [Mag] Computational Algebra Group. The Magma Computational Algebra System for Algebra, Number Theory and Geometry. School of Mathematics and Statistics, University of Sydney, http://magma.maths.usyd.edu.au/magma.
12. [Man65] Ju. I. Manin. The Hasse-Witt matrix of an algebraic curve. Trans. Amer. Math. Soc., 45:245-246, 1965.
13. [MCT02] K. Matsuo and J. Chao and S. Tsujii. An improved baby step giant step algorithm for point counting of hyperelliptic curves over finite fields. In Algorithmic Number Theory Symposium ANTS-V, volume 2369 of Lecture Notes in Computer Science, pages 461-474. Springer-Verlag, 2002. MR2041104 (2005a:11089)
14. [P1190] J. Pila. Probenius maps of abelian varieties and finding roots of unity in finite fields. Mathematics of Computation, 55(192):745-763, 1990. MR1035941 (91a:11071)
15. [PH78] S. C. Pohlig and M. E. Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE-Transactions on Information Theory, 24:106-110, 1978. MR0484737 (58:4617)
16. [Pol78] J. M. Pollard. Monte Carlo methods for index computation (mod p). Mathematics of Computation, 32(143):918-924, 1978. MR0491431 (58:10684)
17. [Sar91] J. Estrada Sarlabous. On the Jacobian varieties of Picard curves defined over fields of characteristic p > 0. Math. Nachr., 152:392-340, 1991. MR1121242 (93g:14033)
18. [Sch01] R. Scheidler. Ideal arithmetic and infrastructure in purely cubic function fields. Journal de Théorie des Nombres de Bordeaux, 13:609-631, 2001. MR1879675 (2002k:11209)
19. [SS] R. Scheidler and A. Stein. Computing the Class Number of a Cubic Function Field. Talk by A. Stein at the Conference in Number Theory in Honour of Professor H.C. Williams, Banff, May 2003.
20. [ST02a] A. Stein and E. Teske. Explicit bounds and heuristics on class numbers in hyperelliptic function fields. Mathematics of Computation, 71:837-861, 2002. MR1885633 (2002k:11210)
21. [ST02b] A. Stein and E. Teske. The parallelized Pollard kangaroo method in real quadratic function fields. Mathematics of Computation, 71:793-814, 2002. MR1885629 (2002k:11227)
22. [Sti93] H. Stichtenoth. Algebraic Function Fields and Codes. Springer, Berlin, 1993. MR1251961 (94k:14016)
23. [Tat66] J. Tate. Endomorphisms of abelian varieties over finite fields. Invent. Math., 2:134-144, 1966. MR0206004 (34:5829)
24. [Thé03] N. Thériault. Index calculus attack for hyperelliptic curves of small genus. In Advances in Cryptology - ASIACRYPT 2003, volume 2894 of Lecture Notes in Computer Science, pages 75-92. Springer-Verlag, 2003. MR2093253
25. [vOW99] P. C. van Oorschot and M. J. Wiener. Parallel collision search with cryptanalytic applications. Journal of Cryptology, 12:1-28, 1999. MR1664774 (99i:94054)
26. [Wat69] W. C. Waterhouse. Abelian varieties over finite fields. Ann. Sci. École Norm. Sup. (4), 2:521-560, 1969. MR0265369 (42:279)