Counting points on curves over finite fields

DOI10.1006/jsco.1997.0164zbMath0919.11046OpenAlexW2084377627MaRDI QIDQ1382038

D. Massart

Publication date: 15 February 1999

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1997.0164

zbMATH Keywords

rational pointscurves over finite fieldseffective algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Finite ground fields in algebraic geometry (14G15) Computational aspects of algebraic curves (14Q05)

Related Items

Rigid cohomology and \(p\)-adic point counting ⋮ Modular equations for hyperelliptic curves ⋮ Approximating Euler products and class number computation in algebraic function fields ⋮ Improved complexity bounds for counting points on hyperelliptic curves ⋮ Genus 2 point counting over prime fields ⋮ Counting points on genus-3 hyperelliptic curves with explicit real multiplication ⋮ Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\) ⋮ Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time ⋮ Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus ⋮ On counting and generating curves over small finite fields ⋮ A double large prime variation for small genus hyperelliptic index calculus ⋮ Computing Riemann-Roch spaces in algebraic function fields and related topics. ⋮ Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology