Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00512401
Contributor : Pierrick Gaudry <>
Submitted on : Monday, August 30, 2010 - 1:10:01 PM
Last modification on : Thursday, March 5, 2020 - 6:21:44 PM
Document(s) archivé(s) le : Thursday, December 1, 2016 - 3:17:58 PM

File

euro2K.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

353

Files downloads

2276