arXiv · 1710.03448
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves
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.
Explore related subjects
Keep this discovery
Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer. 2017-10-10. Improved Complexity Bounds for Counting Points on Hyperelliptic Curves. https://arxiv.org/abs/1710.03448
Cite the original work for its findings. Save a collection to share your selection of sources.