Asymptotically fast group operations on Jacobians of general curves

Mathematics – Number Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

27 pages, considerably improved and streamlined revision of previous draft. Readers wishing to consult the previous extended d

Scientific paper

Let $C$ be a curve of genus $g$ over a field $k$. We describe probabilistic algorithms for addition and inversion of the classes of rational divisors in the Jacobian of $C$. After a precomputation, which is done only once for the curve $C$, the algorithms use only linear algebra in vector spaces of dimension at most $O(g \log g)$, and so take $O(g^{3 + \epsilon})$ field operations in $k$, using Gaussian elimination. Using fast algorithms for the linear algebra, one can improve this time to $O(g^{2.376})$. This represents a significant improvement over the previous record of $O(g^4)$ field operations (also after a precomputation) for general curves of genus $g$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Asymptotically fast group operations on Jacobians of general 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 Asymptotically fast group operations on Jacobians of general curves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotically fast group operations on Jacobians of general curves will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-530854

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.