2 citations · 3 across the 3 of their papers we have counts for
Showing cs.CRShow all
2 papers · 1 filter
cs.CR2020★ 1 cited
Refined Analysis of the Asymptotic Complexity of the Number Field Sieve
Aude Le Gluher, Pierre-Jean Spaenlehauer, Emmanuel Thomé
The classical heuristic complexity of the Number Field Sieve (NFS) is the solution of an optimization problem that involves an unknown function, usually noted and called $ξ(…
cs.CR2020
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic +3
We report on two new records: the factorization of RSA-240, a 795-bit number, and a discrete logarithm computation over a 795-bit prime field. Previous records were the factorizati…