A new ranking function for polynomial selection in the number field sieve

DOI10.1090/conm/754/15139zbMath1472.11309OpenAlexW2948853925MaRDI QIDQ4998643

Nicolas David, Paul Zimmermann

Publication date: 9 July 2021

Published in: 75 Years of Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-02151093v4/file/rootsieve-revised3.pdf

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Uses Software

• CADO-NFS

Cites Work

• Better polynomials for GNFS
• On polynomial selection for the general number field sieve
• Factorization of a 768-Bit RSA Modulus
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• Root optimization of polynomials in the number field sieve

This page was built for publication: A new ranking function for polynomial selection in the number field sieve