, P. Better polynomials for GNFS. Mathematics of Computation, vol.85, pp.861-873, 2016.
Root optimization of polynomials in the number field sieve, Mathematics of Computation, vol.84, pp.2447-2457, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-00919367
On the alpha value of polynomials in the tower number field sieve algorithm. Cryptology ePrint Archive, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02263098
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the Gaussian integer method, Mathematics of Computation, vol.72, pp.953-967, 2003. ,
URL : https://hal.archives-ouvertes.fr/hal-01102016
On polynomial selection for the general number field sieve, Mathematics of Computation, vol.75, pp.2037-2047, 2006. ,
Factorization of a 768-bit RSA modulus, CRYPTO 2010 Advances in Cryptology -CRYPTO 2010, vol.6223, pp.333-350, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00444693
Polynomial Selection for the Number Field Sieve Integer Factorisation Algorithm, vol.144, 1999. ,
, The CADO-NFS Development Team. CADO-NFS, an implementation of the number field sieve algorithm, 2017.