| HAL-Inria | Publications, software ... of Inria's scientists |
Journal articles
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.
Cited literature [29 references]
https://hal.inria.fr/hal-01613530
Contributor : Pierre-Jean Spaenlehauer <>
Submitted on : Thursday, June 7, 2018 - 9:55:49 AM
Last modification on : Thursday, June 6, 2019 - 7:44:25 AM
Document(s) archivé(s) le : Saturday, September 8, 2018 - 12:33:22 PM
Contributor : Pierre-Jean Spaenlehauer <>
Submitted on : Thursday, June 7, 2018 - 9:55:49 AM
Last modification on : Thursday, June 6, 2019 - 7:44:25 AM
Document(s) archivé(s) le : Saturday, September 8, 2018 - 12:33:22 PM
File
paper.pdf
Files produced by the author(s)