Linear recurrences with polynomial coefficients and computation of the Cartier-Manin operator on hyperelliptic curves

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

Volumn 2948, Issue , 2004, Pages 40-58

  Bostan, Alin ^a,b   Gaudry, Pierrick ^c   Schost, Éric ^a  

^a ECOLE POLYTECHNIQUE   (France)

^b Department of Mathematics   (Romania)

^c ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GEOMETRY;

ARITHMETIC PROGRESSIONS; FAST ALGORITHMS; HYPER-ELLIPTIC CURVES; INTERMEDIATE RESULTS; LINEAR RECURRENCES; POLYNOMIAL COEFFICIENTS; PRIME FIELD; RECURRENT SEQUENCES;

POLYNOMIALS;

EID: 35048885494     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24633-6_4     Document Type: Article

References (33)

1. Medicis. http://www.medicis.polytechnique.fr/.
2. A. V. Aho, K. Steiglitz, and J. D. Ullman. Evaluating polynomials at fixed sets of points. SIAM J. Comput., 4(4):533-539, 1975.
3. D. Bailey and C. Paar. Optimal extension fields for fast arithmetic in public-key algorithms. In Advances in Cryptology - CRYPTO '98, volume 1462 of LNCS, pages 472-485. Springer-Verlag, 1998.
4. A. Borodin and R. T. Moenck. Fast modular transforms. Comput. System Sci., 8(3):366-386, 1974.
5. W. Bosma, J. Cannon, and C. Playoust. The Magma algebra system. I. The user language. J. Symb. Comp., 24(3-4):235-265, 1997. See also http://www.maths.usyd.edu.au:8000/u/magma/.
6. A. Bostan, G. Lecerf, and É. Schost. Tellegen's principle into practice. In Proceedings of ISSAC'03, pages 37-44. ACM Press, 2003.
7. P. Bürgisser, M. Clausen, and M. A. Shokrollahi. Algebraic complexity theory, volume 315 of Grundlehren Math. Wiss. Springer-Verlag, 1997.
8. D. G. Cantor and E. Kaltofen. On fast multiplication of polynomials over arbitrary algebras. Acta Informatica, 28(7):693-701, 1991.
9. P. Cartier. Une nouvelle opération sur les formes différentielles. C. R. Acad. Sci. Paris, 244:426-428, 1957.
10. D. V. Chudnovsky and G. V. Chudnovsky. Approximations and complex multiplication according to Ramanujan. In Ramanujan revisited (Urbana-Champaign, Ill., 1987), pages 375-472. Academic Press, Boston, MA, 1988.
11. P. Flajolet and B. Salvy. The SIGSAM challenges: Symbolic asymptotics in practice. SIGSAM Bull., 31(4):36-47, 1997.
12. P. Gaudry and N. Gürel. Counting points in medium characteristic using Kedlaya's algorithm. To appear in Experiment. Math.
13. P. Gaudry and R. Harley. Counting points on hyperelliptic curves over finite fields. In ANTS-IV, volume 1838 of LNCS, pages 313-332. Springer-Verlag, 2000.
14. 24 + 41). e-mail to the NMBRTHRY mailing list. Sept. 2002.
15. G. Hanrot, M. Quercia, and P. Zimmermann. The middle product algorithm, I. Speeding up the division and square root of power series. Preprint.
16. H. Hasse and E. Witt. Zyklische unverzweigte Erweiterungskörper vom primzahlgrade p über einem algebraischen Funktionenkörper der Charakteristik p. Monatsch. Math. Phys., 43:477-492, 1936.
17. E. Kaltofen, R. M. Corless, and D. J. Jeffrey. Challenges of symbolic computation: my favorite open problems. J. Symb. Comp., 29(6):891-919, 2000.
18. K. Kedlaya. Countimg points on hyperelliptic curves using Monsky-Washnitzer. J. Ramanujan Math. Soc., 16:323-338, 2001.
19. W. Keller-Gehrig. Fast algorithms for the characteristic polynomial. Theor. Comput. Sci., 36(2-3):309-317, 1985.
20. J. I. Manin. The Hasse-Witt matrix of an algebraic curve. Trans. Amer. Math. Soc., 45:245-264, 1965.
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 ANTS-V, volume 2369 of LNCS, pages 461-474. Springer-Verlag, 2002.
22. R. T. Moenck and A. Borodin. Fast modular transforms via division. Thirteenth Annual IEEE Symposium on Switching and Automata Theory (Univ. Maryland, College Park, Md., 1972), pages 90-96, 1972.
23. J. M. Pollard. Theorems on factorization and primality testing. Proc. Cambridge Philos. Soc., 76:521-528, 1974.
24. A. Schönhage. Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2. Acta Informatica, 7:395-398, 1977.
25. A. Schönhage and V. Strassen. Schnelle Multiplikation großer Zahlen. Computing, 7:281-292, 1971.
26. V. Shoup. NTL: A library for doing number theory. http://www.shoup.net.
27. V. Shoup. A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic. In Proceedings of ISSAC'91, pages 14-21. ACM Press, 1991.
28. K.-O. Stöhr and J. Voloch. A formula for the Cartier operator on plane algebraic curves. J. Reine Angew. Math., 377:49-64, 1987.
29. V. Strassen. Gaussian elimination is not optimal. Numer. Math., 13:354-356, 1969.
30. V. Strassen. Einige Resultate über Berechnungskomplexität. Jber. Deutsch. Math.-Verein., 78(1):l-8, 1976/77.
31. J. von zur Gathen and J. Gerhard. Modern computer algebra. Cambridge University Press, 1999.
32. D. Wan. Computing zeta functions over finite fields. Con temp. Math., 225:131-141, 1999.
33. N. Yui. On the Jacobian varîetes of hyperelliptic curves over fields of characteristic p > 2. J. Algebra, 52:378-410, 1978.