Computing L-Series of Hyperelliptic Curves

13 years 6 months ago

Download www-math.mit.edu

We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic methods.

Kiran S. Kedlaya, Andrew V. Sutherland

Real-time Traffic

Algorithms | ANTS 2008 | Generic Group Algorithms | Hyperelliptic Curve | P-adic Methods |

claim paper

Related Content

» Hyperelliptic Pairings

» An Extension of Kedlayas Algorithm to Hyperelliptic Curves in Characteristic 2

» SkewFrobenius Maps on Hyperelliptic Curves

» Group Law Computations on Jacobians of Hyperelliptic Curves

» Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems

» An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves

» Numerical Uniformization of Hyperelliptic Curves

» Efficient pairing computation on supersingular Abelian varieties

» Hyperelliptic Curves with Compact Parameters

Post Info
More Details (n/a)

Added	12 Oct 2010
Updated	12 Oct 2010
Type	Conference
Year	2008
Where	ANTS
Authors	Kiran S. Kedlaya, Andrew V. Sutherland

Comments (0)

Sciweavers

Computing L-Series of Hyperelliptic Curves

Algorithms | ANTS 2008 | Generic Group Algorithms | Hyperelliptic Curve | P-adic Methods |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers