M. Elkenbracht-huizing, An Implementation of the Number Field Sieve, Experimental Mathematics, vol.5, issue.3, pp.231-253, 1996.
DOI : 10.1090/S0025-5718-1993-1182953-4

G. Hanrot, The LLL Algorithm. Survey and Applications, ch. LLL: A Tool for Effective Diophantine Approximation, pp.215-263, 2010.

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. Slides presented at the CADO workshop, 2008.

T. Kleinjung, K. Aoki, J. Franke, A. K. Lenstra, E. Thomé et al., Factorization of a 768-Bit RSA Modulus, CRYPTO 2010 Advances in Cryptology -CRYPTO 2010 of Lecture Notes in Computer Science, pp.333-350, 2010.
DOI : 10.1007/978-3-642-14623-7_18
URL : https://hal.archives-ouvertes.fr/inria-00444693

A. K. Lenstra, H. W. Lenstra, and L. Lovász, Factoring polynomials with rational coefficients, Mathematische Annalen, vol.32, issue.4, pp.515-534, 1982.
DOI : 10.1007/BF01457454

P. L. Montgomery, Small geometric progressions modulo n. Unpublished note of 2 pages, 1993.

P. L. Montgomery, Searching for higher-degree polynomials for the general number field sieve, 2006.

B. A. Murphy, Polynomial Selection for the Number Field Sieve Integer Factorisation Algorithm, 1999.

R. S. Williams, Cubic polynomials in the number field sieve, 2010.