We present an algorithm for computing the zeta function of an arbitrary hyperelliptic curve over a finite field Fq of characteristic 2, thereby extending the algorithm of Kedlaya for small odd characteristic. For a genus g hyperelliptic curve over F2n, the asymptotic running time of the algorithm is O(g5+εn3+ε) and the space complexity is O(g3n3).
CITATION STYLE
Vercauteren, F. (2002). Computing zeta functions of hyperelliptic curves over finite fields of characteristic 2. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2442, pp. 369–384). Springer Verlag. https://doi.org/10.1007/3-540-45708-9_24
Mendeley helps you to discover research relevant for your work.