2020/07/06 by Aude Le Gluher, Gluher, Aude Le, Pierre-Jean Spaenlehauer +3
Computer Science · #Coding theory and cryptography #Computational Complexity (cs.CC) #Cryptography and Data Security #Cryptography and Residue Arithmetic #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.2007.02730
openalex publication_date 2020/07/06 · openalex created_date 2020/07/10 · openalex updated_date 2026/07/28
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 ξ(N) throughout this paper, which tends to zero as the entry N grows. The aim of this paper is to find optimal asymptotic choices of the parameters of NFS as N grows, in order to minimize its heuristic asymptotic computational cost. This amounts to minimizing a function of the parameters of NFS bound together by a non-linear constraint. We provide precise asymptotic estimates of the minimizers of this optimization problem, which yield refined formulas for the asymptotic complexity of NFS. One of the main outcomes of this analysis is that ξ(N) has a very slow rate of convergence: We prove that it is equivalent to 4logloglog N/(3loglog N). Moreover, ξ(N) has an unpredictable behavior for practical estimates of the complexity. Indeed, we provide an asymptotic series expansion of ξ and numerical experiments indicate that this series starts converging only for N>exp(exp(25)), far beyond the practical range of NFS. This raises doubts on the relevance of NFS running time estimates that are based on setting ξ=0 in the asymptotic formula.