Computing zeta functions of hyperelliptic curves over finite fields of characteristic 2

F Vercauteren

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

15 Citations (Scopus)

Abstract

We present an algorithm for computing the zeta function of an arbitrary hyperelliptic curve over a finite field $\FF_q$ of characteristic 2, thereby extending the algorithm of Kedlaya for small odd characteristic. For a genus $g$ hyperelliptic curve over $\FF_2^n$, the asymptotic running time of the algorithm is $O(g^5 + arepsilon n^3 + arepsilon)$ and the space complexity is $O(g^4 n^3)$.
Original languageEnglish
Title of host publicationAdvances in Cryptology -- CRYPTO 2002
PublisherSpringer Berlin Heidelberg
Pages369 - 384
Number of pages15
Volume2442
Publication statusPublished - Aug 2002

Bibliographical note

Editors: Moti Yung
Publisher: Springer

Fingerprint Dive into the research topics of 'Computing zeta functions of hyperelliptic curves over finite fields of characteristic 2'. Together they form a unique fingerprint.

  • Cite this

    Vercauteren, F. (2002). Computing zeta functions of hyperelliptic curves over finite fields of characteristic 2. In Advances in Cryptology -- CRYPTO 2002 (Vol. 2442, pp. 369 - 384). Springer Berlin Heidelberg. http://www.cs.bris.ac.uk/Publications/pub_info.jsp?id=1000652