B. Lamacchia and A. Odlyzko, Solving Large Sparse Linear Systems Over Finite Fields, Advances in Cryptology- CRYPT0' 90, pp.109-133, 1991.
DOI : 10.1007/3-540-38424-3_8

C. Pomerance and J. W. Smith, Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes, Experimental Mathematics, vol.32, issue.2, pp.89-94, 1992.
DOI : 10.1080/10586458.1992.10504250

S. Cavallar, On the number field sieve integer factorization algorithm, 2002.

S. Bai, P. Gaudry, A. Kruppa, F. Morain, E. Thomé et al., Crible algébrique: distribution, optimisation (CADO-NFS)

A. Lenstra, H. Lenstra, M. Manasse, and J. Pollard, The number field sieve The development of the number field sieve, Lecture Notes in Mathematics, vol.1554, 1993.

L. M. Adleman, The function field sieve, Algorithmic Number Theory, pp.108-121, 1994.
DOI : 10.1007/3-540-58691-1_48

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

R. Barbulescu, C. Bouvier, J. Detrey, P. Gaudry, H. Jeljeli et al., Discrete logarithm in GF(2 809 ) with FFS, preprint, 6 pages, 2013.

H. Markowitz, The Elimination form of the Inverse and its Application to Linear Programming, Management Science, vol.3, issue.3, pp.255-269, 1957.
DOI : 10.1287/mnsc.3.3.255

D. Wiedemann, Solving sparse linear equations over finite fields, Information Theory, IEEE Transactions on, vol.32, issue.1, pp.54-62, 1986.

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

E. Thomé, Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm, Proceedings of the 2001 international symposium on Symbolic and algebraic computation , ISSAC '01, pp.323-331, 2001.
DOI : 10.1145/384101.384145

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

W. Hart, Archives of the Number Theory Mailing List (NMBRTHRY), https, p.0, 2012.

S. Bai, E. Thomé, and P. Zimmermann, Factorisation of RSA-704 with CADO- NFS, Cryptology ePrint Archive, 2012.

J. Detrey, P. Gaudry, and M. Videau, Relation Collection for the Function Field Sieve, 2013 IEEE 21st Symposium on Computer Arithmetic, pp.201-210, 2013.
DOI : 10.1109/ARITH.2013.28
URL : https://hal.archives-ouvertes.fr/hal-00736123

R. Barbulescu, C. Bouvier, J. Detrey, P. Gaudry, H. Jeljeli et al., The relationship between some guy and cryptography , ECC2012 rump session talk (humoristic), see http, 2012.

?. N. After-purge-after-merge, Complete data for discrete logarithm in GF(2 809 ) After purge After merge, 35e+14 887905 7.88e+13 +87.48% 02 2490830 1.35e+14 887956 7.88e+13 +87.50% s2 2480183 1.34e+14 888767 7.90e+13 +87.84% s0 2504747 1.37e+14 890097 7.92e+13 +88.40% 00 2504738 1.37e+14 890107 7.92e+13 +88.41% s1 2548952 1.40e+14 949242 9.01e+13 +114.27% Table A.13: Complete data for discrete logarithm in GF(2 619 ).27% Table A.15: Complete data for discrete logarithm in GF, p.1039