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 $o(1)$ and called $ξ(…