An algorithm for solving the discrete log problem on hyperelliptic curves - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2000

An algorithm for solving the discrete log problem on hyperelliptic curves

Abstract

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.
Fichier principal
Vignette du fichier
euro2K.pdf (261.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00512401 , version 1 (30-08-2010)

Identifiers

Cite

Pierrick Gaudry. An algorithm for solving the discrete log problem on hyperelliptic curves. Eurocrypt, 2000, Bruges, Belgium. pp.19-34, ⟨10.1007/3-540-45539-6_2⟩. ⟨inria-00512401⟩
332 View
1649 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More