Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Discrete logarithm in GF(2^809) with FFS

Razvan Barbulescu 1 Cyril Bouvier 1 Jérémie Detrey 1 Pierrick Gaudry 1 Hamza Jeljeli 1 Emmanuel Thomé 1 Marion Videau 1 Paul Zimmermann 1
1 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : We give details on solving the discrete logarithm problem in the 202-bit prime order subgroup of GF(2^809)* using the Function Field Sieve algorithm.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.inria.fr/hal-00818124
Contributor : Pierrick Gaudry <>
Submitted on : Friday, April 26, 2013 - 9:46:16 AM
Last modification on : Friday, October 16, 2020 - 4:02:04 PM
Long-term archiving on: : Monday, April 3, 2017 - 11:54:23 PM

File

197.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00818124, version 1

Citation

Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, et al.. Discrete logarithm in GF(2^809) with FFS. 2013. ⟨hal-00818124v1⟩

Share

Metrics

Record views

101

Files downloads

93