L. M. Adleman, Factoring numbers using singular integers, Proceedings of the twenty-third annual ACM symposium on Theory of computing , STOC '91, pp.64-71, 1991.
DOI : 10.1145/103418.103432

K. Aoki, J. Franke, T. Kleinjung, A. K. Lenstra, and D. A. Osvik, A Kilobit Special Number Field Sieve Factorization, ASIACRYPT 2007, pp.1-12, 2007.
DOI : 10.1007/978-3-540-76900-2_1

F. Bahr, M. Böhm, J. Franke, and T. Kleinjung, Factorization of RSA-200, 2005.

J. Buhler, P. Montgomery, R. Robson, and R. Ruby, Implementing the number field sieve, 1994.

S. Cavallar, Strategies in Filtering in the Number Field Sieve, ANTS 2000, pp.209-232, 2000.
DOI : 10.1007/10722028_11

S. Cavallar, B. Dodson, A. K. Lenstra, W. M. Lioen, P. L. Montgomery et al., Factorization of a 512-Bit RSA Modulus, EUROCRYPT 2000, pp.1-18, 2000.
DOI : 10.1007/3-540-45539-6_1
URL : https://hal.archives-ouvertes.fr/inria-00099117

D. Coppersmith, Solving linear equations over GF(2): block Lanczos algorithm, Linear Algebra and its Applications, vol.192, pp.33-60, 1993.
DOI : 10.1016/0024-3795(93)90235-G

D. Coppersmith, Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm, Mathematics of Computation, vol.62, issue.205, pp.333-350, 1994.
DOI : 10.2307/2153413

J. Cowie, B. Dodson, R. M. Elkenbracht-huizing, A. K. Lenstra, P. L. Montgomery et al., A World Wide Number Field Sieve factoring record: On to 512 bits, ASIACRYPT 1996, pp.382-394, 1996.
DOI : 10.1007/BFb0034863

J. D. Dixon, Asymptotically fast factorization of integers, Mathematics of Computation, vol.36, issue.153, pp.255-260, 1981.
DOI : 10.1090/S0025-5718-1981-0595059-1

J. Franke and T. Kleinjung, Continued fractions and lattice sieving, SHARCS, 2005.

R. A. Golliver, A. K. Lenstra, and K. S. Mccurley, Lattice sieving and trial division, ANTS 1994, pp.18-27, 1994.
DOI : 10.1007/3-540-58691-1_38

T. Kleinjung, Cofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024 bit integers, SHARCS, 2005.

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. Presented at the CADO Workshop on Integer Factorization, 2008.

A. K. Lenstra, COMPUTATIONAL METHODS IN PUBLIC KEY CRYPTOLOGY, pp.175-238, 2002.
DOI : 10.1142/9789812388841_0005

A. K. Lenstra, L. Jr, and H. W. , Algorithms in Number Theory, pp.673-716, 1990.
DOI : 10.1016/B978-0-444-88071-0.50017-5

A. K. Lenstra, L. Jr, and H. W. , The Development of the Number Field Sieve, LNM, vol.1554, 1993.
DOI : 10.1007/BFb0091534

A. K. Lenstra, L. Jr, H. W. Manasse, M. S. Pollard, and J. M. , The factorization of the ninth Fermat number, Mathematics of Computation, vol.61, issue.203, pp.61-319, 1993.
DOI : 10.1090/S0025-5718-1993-1182953-4

A. K. Lenstra, E. Tromer, A. Shamir, W. Kortsmit, B. Dodson et al., Factoring Estimates for a 1024-Bit RSA Modulus, ASIACRYPT 2003, pp.55-74, 2003.
DOI : 10.1007/978-3-540-40061-5_4

J. Massey, Shift-register synthesis and BCH decoding, IEEE Transactions on Information Theory, vol.15, issue.1, pp.122-127, 1969.
DOI : 10.1109/TIT.1969.1054260

P. Montgomery, Square roots of products of algebraic numbers
DOI : 10.1090/psapm/048/1314892

P. Montgomery and B. Murphy, Improved polynomial selection for the number field sieve, 1999.

M. A. Morrison and J. Brillhart, A method of factoring and the factorization of F7, Math. of Comp, vol.29, issue.129, pp.183-205, 1975.

B. Murphy, Modelling the yield of number field sieve polynominals, ANTS 1998, pp.137-150, 1998.

P. Q. Nguyen, A Montgomery-like square root for the Number Field Sieve, ANTS 1998, pp.151-168, 1998.
DOI : 10.1007/BFb0054859

J. M. Pollard, The lattice sieve, pp.43-49
DOI : 10.1090/psapm/042/1095550

C. Pomerance, H. W. Lenstra-jr, and R. Tijdeman, Analysis and comparison of some integer factoring algorithms Computational Methods in Number Theory, Math. Centrum Tract, vol.154, pp.89-139, 1982.

C. Pomerance, The Quadratic Sieve Factoring Algorithm, EUROCRYPT 1984, pp.169-182, 1985.
DOI : 10.1007/3-540-39757-4_17

C. Pomerance, A tale of two sieves, 1996.

R. L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, issue.2, pp.120-126, 1978.
DOI : 10.1145/359340.359342

Q. Tarantino, That's a bingo! http://www.youtube.com/watch?v=WtHTc8wIo4Q, 361748.

E. Thomé, Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm, Journal of Symbolic Computation, vol.33, issue.5, pp.757-775, 2002.
DOI : 10.1006/jsco.2002.0533