S. Bai, C. Bouvier, A. Filbois, P. Gaudry, L. Imbert et al., CADO-NFS, an implementation of the number field sieve. Release 2.1, available from http, 2014.

S. Bai, R. P. Brent, and E. Thomé, Root optimization of polynomials in the number field sieve, Mathematics of Computation, vol.84, issue.295, p.2014
DOI : 10.1090/S0025-5718-2015-02926-3

URL : https://hal.archives-ouvertes.fr/hal-00919367

S. Bai, E. Thomé, and P. Zimmermann, Factorisation of RSA-704 with CADO-NFS, Report, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00760322

R. Barbulescu and A. Lachand, Some mathematical remarks on the polynomial selection in NFS, Mathematics of Computation, vol.86, issue.303, 2014.
DOI : 10.1090/mcom/3112

URL : https://hal.archives-ouvertes.fr/hal-00954365

H. Boender, Factoring large integers with the quadratic sieve, 1997.

J. Buhler, H. Lenstra, and C. Pomerance, Factoring integers with the number field sieve, Lenstra and Lenstra [11], pp.50-94
DOI : 10.1109/TIT.1986.1057137

A. Granville, Smooth numbers: computational number theory and beyond Algorithmic Number Theory: Lattices, Number Fields, Curves and Cryptography, Proc. MSRI Conf, 2008.

A. Hildebrand and G. Tenenbaum, Integers without large prime factors, Journal de Th??orie des Nombres de Bordeaux, vol.5, issue.2, pp.411-484, 1993.
DOI : 10.5802/jtnb.101

T. Kleinjung, On polynomial selection for the general number field sieve, Mathematics of Computation, vol.75, issue.256, pp.2037-2047, 2006.
DOI : 10.1090/S0025-5718-06-01870-9

T. Kleinjung, Polynomial selection, CADO workshop on integer factorization, 2008.

B. A. Murphy, Modelling the yield of number field sieve polynomials, Algorithmic Number Theory -ANTS III, pp.137-147, 1998.
DOI : 10.1007/BFb0054858

B. A. Murphy, Polynomial selection for the number field sieve integer factorisation algorithm, 1999.

B. A. Murphy and R. P. Brent, On quadratic polynomials for the number field sieve, Proceedings of the CATS '98, pp.199-213, 1998.

J. Papadopoulos, Call for volunteers: RSA768 polynomial selection, 2011.

J. Papadopoulos, Msieve v1, 2011.

J. M. Pollard, The lattice sieve, Lenstra and Lenstra [11], pp.43-49
DOI : 10.1090/psapm/042/1095550

T. Kleinjung, K. Aoki, J. Franke, A. K. Lenstra, E. Thomé et al., Factorization of a 768-Bit RSA Modulus, Proceedings of CRYPTO '10, pp.333-350, 2010.
DOI : 10.1007/978-3-642-14623-7_18

URL : https://hal.archives-ouvertes.fr/inria-00444693

R. D. Silverman, The multiple polynomial quadratic sieve, Mathematics of Computation, vol.48, issue.177, pp.329-339, 1987.
DOI : 10.1090/S0025-5718-1987-0866119-8

A. Lenstra, E. Tromer, A. Shamir, W. Kortsmit, B. Dodson et al., Leyland Factoring Estimates for a 1024-Bit RSA Modulus, Advances in Cryptology -Asiacrypt, pp.55-74, 2003.

T. Kleinjung, Cofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024 bit integers E-mail address: shih.bai@gmail.com INRIA Nancy -Grand Est, Villers-l` es-Nancy, France. E-mail address: cyril.bouvier@inria.fr INRIA Nancy -Grand Est, Villers-l` es-Nancy, France. E-mail address: alexander.kruppa@inria.fr INRIA Nancy -Grand Est, Villers-l` es, 2005.