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.

• Type: Conference
• Year: 2000
• Where: EUROCRYPT
• Authors: Pierrick Gaudry
• Keywords: Cryptology, Discrete Logarithms, EUROCRYPT 2000, Hyperelliptic Curves, Index-calculus Algorithm