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

FFS Factory: Adapting Coppersmith's "Factorization Factory" to the Function Field Sieve

Jérémie Detrey 1, *
* Corresponding author
1 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : In 1993, Coppersmith introduced the "factorization factory" approach as a means to speed up the Number Field Sieve algorithm (NFS) when factoring batches of integers of similar size: at the expense of a large precomputation whose cost is amortized when considering sufficiently many integers to factor, the complexity of each individual factorization can then be lowered. We suggest here to extend this idea to the computation of discrete logarithms in finite fields of small characteristic using the Function Field Sieve (FFS), thus referring to this approach as the "FFS factory". In this paper, the benefits of the proposed technique are established thanks to both a theoretical complexity analysis along with a practical experiment in which we solved the discrete logarithm problem in fifty different binary fields of sizes ranging from 601 to 699 bits.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Jérémie Detrey Connect in order to contact the contributor
Submitted on : Friday, June 6, 2014 - 10:21:44 AM
Last modification on : Saturday, October 16, 2021 - 11:26:06 AM
Long-term archiving on: : Saturday, September 6, 2014 - 11:32:13 AM


Files produced by the author(s)


  • HAL Id : hal-01002419, version 1



Jérémie Detrey. FFS Factory: Adapting Coppersmith's "Factorization Factory" to the Function Field Sieve. 2014. ⟨hal-01002419⟩



Les métriques sont temporairement indisponibles