Construction of secure random curves of genus 2 over prime fields - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

Construction of secure random curves of genus 2 over prime fields

Abstract

For counting points of Jacobians of genus 2 curves defined over large prime fields, the best known method is a variant of Schoof's algorithm. We present several improvements on the algorithms described by Gaudry and Harley in 2000. In particular we rebuild the symmetry that had been broken by the use of Cantor's division polynomials and design a faster division by 2 and a division by 3. Combined with the algorithm by Matsuo, Chao and Tsujii, our implementation can count the points on a Jacobian of size 164 bits within about one week on a PC.
Fichier principal
Vignette du fichier
secureg2.pdf (272.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00514121 , version 1 (01-09-2010)

Identifiers

Cite

Pierrick Gaudry, Eric Schost. Construction of secure random curves of genus 2 over prime fields. Eurocrypt, 2004, Interlaken, Switzerland. pp.239-256, ⟨10.1007/978-3-540-24676-3_15⟩. ⟨inria-00514121⟩
123 View
152 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More