Sciweavers

Share
EUROCRYPT
2000
Springer

An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves

11 years 10 months ago
An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves
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
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 2000
Where EUROCRYPT
Authors Pierrick Gaudry
Comments (0)
books