# Improved Complexity Bounds for Counting Points on Hyperelliptic Curves

1 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : We present a probabilistic Las Vegas algorithm for computing the local zeta function of a hyperelliptic curve of genus $g$ defined over $\mathbb{F}_q$. It is based on the approaches by Schoof and Pila combined with a modeling of the $\ell$-torsion by structured polynomial systems. Our main result improves on previously known complexity bounds by showing that there exists a constant $c > 0$ such that, for any fixed $g$, this algorithm has expected time and space complexity $O((\log q)^{cg})$ as $q$ grows and the characteristic is large enough.
Type de document :
Article dans une revue
Foundations of Computational Mathematics, Springer Verlag, In press, 〈10.1007/s10208-018-9392-1〉
Domaine :

Littérature citée [29 références]

https://hal.inria.fr/hal-01613530
Contributeur : Pierre-Jean Spaenlehauer <>
Soumis le : jeudi 7 juin 2018 - 09:55:49
Dernière modification le : jeudi 7 février 2019 - 15:13:20
Document(s) archivé(s) le : samedi 8 septembre 2018 - 12:33:22

### Fichier

paper.pdf
Fichiers produits par l'(les) auteur(s)

### Citation

Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer. Improved Complexity Bounds for Counting Points on Hyperelliptic Curves. Foundations of Computational Mathematics, Springer Verlag, In press, 〈10.1007/s10208-018-9392-1〉. 〈hal-01613530v2〉

### Métriques

Consultations de la notice

## 326

Téléchargements de fichiers