A p-adic quasi-quadratic point counting algorithm

Details A p-adic quasi-quadratic point counting algorithm A p-adic quasi-quadratic point counting algorithm

2007-06-01

arxiv.org/abs/0706.0234v3

Mathematics

Number Theory

32 pages

Scientific paper

In this article we give an algorithm for the computation of the number of rational points on the Jacobian variety of a generic ordinary hyperelliptic curve defined over a finite field of cardinality $q$ with time complexity $O(n^{2+o(1)})$ and space complexity $O(n^2)$, where $n=\log(q)$. In the latter complexity estimate the genus and the characteristic are assumed as fixed. Our algorithm forms a generalization of both, the AGM algorithm of J.-F. Mestre and the canonical lifting method of T. Satoh. We canonically lift a certain arithmetic invariant of the Jacobian of the hyperelliptic curve in terms of theta constants. The theta null values are computed with respect to a semi-canonical theta structure of level $2^\nu p$ where $\nu >0$ is an integer and $p=\mathrm{char}(\F_q)>2$. The results of this paper suggest a global positive answer to the question whether there exists a quasi-quadratic time algorithm for the computation of the number of rational points on a generic ordinary abelian variety defined over a finite field.

Affiliated with

Also associated with

No associations

Rating

A p-adic quasi-quadratic point counting algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A p-adic quasi-quadratic point counting algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A p-adic quasi-quadratic point counting algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-308564