Counting points on superelliptic curves in average polynomial time

From MaRDI portal
(Redirected from Publication:5853812)



Abstract: We describe the practical implementation of an average polynomial-time algorithm for counting points on superelliptic curves defined over mathbbQ that is substantially faster than previous approaches. Our algorithm takes as input a superelliptic curves ym=f(x) with mge2 and finmathbbZ[x] any squarefree polynomial of degree dge3, along with a positive integer N. It can compute for all pleN not dividing mmathrmlc(f)mathrmdisc(f) in time O(md3Nlog3NloglogN). It achieves this by computing the trace of the Cartier--Manin matrix of reductions of X. We can also compute the Cartier--Manin matrix itself, which determines the p-rank of the Jacobian of X and the numerator of its zeta function modulo~p.






Describes a project that uses

Uses Software






This page was built for publication: Counting points on superelliptic curves in average polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5853812)