2 citations · 3 across the 3 of their papers we have counts for
3 papers
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 $ξ(…
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…
Resummation and Shower Studies
J. Huston, I. Puljak, T. Sjöstrand +1
The transverse momentum spectra of the Z and Higgs bosons are studied, as probes of the consequences of multiple parton emissions in hadronic events. Emphasis is put on constraints…