Skip to Main content Skip to Navigation
Conference papers

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

Abstract : We improve an algorithm originally due to Chudnovsky and Chudnovsky for computing one selected term in a linear recurrent sequence with polynomial coefficients. Using baby-steps / giant-steps techniques, the nth term in such a sequence can be computed in time proportional to sqrt(n), instead of n for a naive approach. As an intermediate result, we give a fast algorithm for computing the values taken by an univariate polynomial P on an arithmetic progression, taking as input the values of P on a translate on this progression. We apply these results to the computation of the Cartier-Manin operator of a hyperelliptic curve. If the base field has characteristic p, this enables us to reduce the complexity of this computation by a factor of order sqrt(p). We treat a practical example, where the base field is an extension of degree 3 of the prime field with p = 2^32 − 5 elements.
Document type :
Conference papers
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download

https://hal.inria.fr/inria-00514132
Contributor : Pierrick Gaudry <>
Submitted on : Wednesday, September 1, 2010 - 1:03:45 PM
Last modification on : Thursday, March 5, 2020 - 6:21:50 PM
Long-term archiving on: : Thursday, December 2, 2010 - 2:45:06 AM

File

cartier.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Alin Bostan, Pierrick Gaudry, Éric Schost. Linear recurrences with polynomial coefficients and computation of the Cartier-Manin operator on hyperelliptic curves. Finite Fields and Applications - Fq7, 2004, Toulouse, France. pp.40-58, ⟨10.1007/978-3-540-24633-6_4⟩. ⟨inria-00514132⟩

Share

Metrics

Record views

237

Files downloads

350