Skip to Main content Skip to Navigation
Conference papers

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

https://hal.inria.fr/inria-00514121
Contributor : Pierrick Gaudry <>
Submitted on : Wednesday, September 1, 2010 - 12:03:16 PM
Last modification on : Thursday, March 5, 2020 - 6:21:50 PM
Long-term archiving on: : Thursday, December 2, 2010 - 2:44:37 AM

File

secureg2.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

265

Files downloads

276