Point counting in families of hyperelliptic curves

Details Point counting in families of hyperelliptic curves Point counting in families of hyperelliptic curves

2006-01-18

arxiv.org/abs/math/0601438v3

Mathematics

Number Theory

33 pages. Changes: major revision

Scientific paper

Let E_G be a family of hyperelliptic curves defined by Y^2=Q(X,G), where Q is defined over a small finite field of odd characteristic. Then with g in an extension degree n field over this small field, we present a deterministic algorithm for computing the zeta function of the curve E_g by using Dwork deformation in rigid cohomology. The time complexity of the algorithm is O(n^(2.667)) and it needs O(n^(2.5)) bits of memory. A slight adaptation requires only O(n^2) space, but costs time O(n^3). An implementation of this last result turns out to be quite efficient for n big enough.

Affiliated with

Also associated with

No associations

Rating

Point counting in families of hyperelliptic curves 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 Point counting in families of hyperelliptic curves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Point counting in families of hyperelliptic curves will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-594363