Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

EUROCRYPT
2000
Springer

favoriteEmaildiscussreport

128views Cryptology» more EUROCRYPT 2000»

An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves

13 years 8 months ago

An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves

Download www.iacr.org

We present an index-calculus algorithm for the computation of discrete logarithms in the Jacobian of hyperelliptic curves defined over finite fields. The complexity predicts that it is faster than the Rho method for genus greater than 4. To demonstrate the efficiency of our approach, we describe our breaking of a cryptosystem based on a curve of genus 6 recently proposed by Koblitz.

Pierrick Gaudry

Real-time Traffic

Cryptology | Discrete Logarithms | EUROCRYPT 2000 | Hyperelliptic Curves | Index-calculus Algorithm |

claim paper

Related Content

» Computing discrete logarithms in highgenus hyperelliptic Jacobians in provably subexponent...

» Index Calculus Attack for Hyperelliptic Curves of Small Genus

» Smooth ideals in hyperelliptic function fields

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

» Formulae for Arithmetic on Genus 2 Hyperelliptic Curves

» Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem

» On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem

» Fast solvers of integral and pseudodifferential equations on closed curves

» On the low hamming weight discrete logarithm problem for nonadjacent representations

Post Info
More Details (n/a)

Added	24 Aug 2010
Updated	24 Aug 2010
Type	Conference
Year	2000
Where	EUROCRYPT
Authors	Pierrick Gaudry

Comments (0)