A double large prime variation for small genus hyperelliptic index calculus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2005

A double large prime variation for small genus hyperelliptic index calculus

Abstract

In this article, we examine how the index calculus approach for computing discrete logarithms in small genus hyperelliptic curves can be improved by introducing a double large prime variation. Two algorithms are presented. The first algorithm is a rather natural adaptation of the double large prime variation to the intended context. On heuristic and experimental grounds, it seems to perform quite well but lacks a complete and precise analysis. Our second algorithm is a considerably simplified variant, which can be analyzed easily. The resulting complexity improves on the fastest known algorithms. Computer experiments show that for hyperelliptic curves of genus three, our first algorithm surpasses Pollard's Rho method even for rather small field sizes.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5764.pdf (230.63 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00077334 , version 1 (30-05-2006)

Identifiers

  • HAL Id : inria-00077334 , version 1

Cite

Pierrick Gaudry, Emmanuel Thomé, Nicolas Thériault, Claus Diem. A double large prime variation for small genus hyperelliptic index calculus. [Research Report] RR-5764, INRIA. 2005. ⟨inria-00077334⟩
239 View
407 Download

Share

Gmail Facebook X LinkedIn More