P. R. Amestoy, I. S. Duff, J. Koster, and J. L-'excellent, A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling, SIAM Journal on Matrix Analysis and Applications, vol.23, issue.1, pp.15-41, 2001.
DOI : 10.1137/S0895479899358194
URL : https://hal.archives-ouvertes.fr/hal-00808293

W. Bosma, J. Cannon, and C. Playoust, The Magma Algebra System I: The User Language, Journal of Symbolic Computation, vol.24, issue.3-4, pp.235-265, 1993.
DOI : 10.1006/jsco.1996.0125

B. Boyer, C. Eder, J. Faugère, S. Lachartre, and F. Martani, GBLA -gröbner basis linear algebra package, 2016.

S. Cavallar, Strategies in Filtering in the Number Field Sieve, Algorithmic Number Theory, 4th International Symposium, pp.209-232, 2000.
DOI : 10.1007/10722028_11

C. Ashcraft, C. Grimes, R. G. Lewis, J. G. Peyton, B. W. Simon et al., Progress in Sparse Matrix Methods for Large Linear Systems On Vector Supercomputers, International Journal of High Performance Computing Applications, vol.1, issue.4, pp.10-30, 1987.
DOI : 10.1177/109434208700100403

D. Coppersmith, Solving homogeneous linear equations over F2 via block wiedemann algorithm, Mathematics of Computation, vol.62, issue.205, pp.333-350, 1994.

T. A. Davis, Algorithm 832, ACM Transactions on Mathematical Software, vol.30, issue.2, pp.196-199, 2004.
DOI : 10.1145/992200.992206

T. A. Davis, Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2), Society for Industrial and Applied Mathematics, 2006.

T. A. Davis and E. P. Natarajan, Algorithm 907, ACM Transactions on Mathematical Software, vol.37, issue.3, 2010.
DOI : 10.1145/1824801.1824814

J. W. Demmel, S. C. Eisenstat, J. R. Gilbert, X. S. Li, and J. W. Liu, A Supernodal Approach to Sparse Partial Pivoting, SIAM Journal on Matrix Analysis and Applications, vol.20, issue.3, pp.720-755, 1999.
DOI : 10.1137/S0895479895291765

I. S. Duff, A. M. Erisman, and J. K. Reid, Direct Methods for Sparse Matrices, Numerical Mathematics and Scientific Computation, 1989.

I. S. Duff and J. K. Reid, Some Design Features of a Sparse Matrix Code, ACM Transactions on Mathematical Software, vol.5, issue.1, pp.18-35, 1979.
DOI : 10.1145/355815.355817

I. S. Duff and J. K. Reid, The Multifrontal Solution of Indefinite Sparse Symmetric Linear, ACM Transactions on Mathematical Software, vol.9, issue.3, pp.302-325, 1983.
DOI : 10.1145/356044.356047

J. G. Dumas, G. Villard, V. G. Ganzha, E. W. Mayr, and E. V. Vorozhtsov, Computing the rank of sparse matrices over finite fields, Proceedings of the fifth International Workshop on Computer Algebra in Scientific Computing, pp.47-62, 2002.

J. Dumas, P. Elbaz-vincent, P. Giorgi, and A. Urbanska, Parallel computation of the rank of large sparse matrices from algebraic K-theory, Proceedings of the 2007 international workshop on Parallel symbolic computation, PASCO '07, pp.27-28, 2007.
DOI : 10.1145/1278177.1278186
URL : https://hal.archives-ouvertes.fr/hal-00142141

J. Faugère and S. Lachartre, Parallel gaussian elimination for gröbner bases computations in finite fields, pp.89-97, 2010.

J. R. Gilbert and T. Peierls, Sparse Partial Pivoting in Time Proportional to Arithmetic Operations, SIAM Journal on Scientific and Statistical Computing, vol.9, issue.5, pp.862-874, 1988.
DOI : 10.1137/0909058

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

B. A. Lamacchia and A. M. Odlyzko, Solving Large Sparse Linear Systems Over Finite Fields, 10th Annual International Cryptology Conference, pp.109-133, 1990.
DOI : 10.1007/3-540-38424-3_8

H. M. 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

J. P. May, B. D. Saunders, and Z. Wan, Efficient matrix rank computation with application to the study of strongly regular graphs, Proceedings of the 2007 international symposium on Symbolic and algebraic computation , ISSAC '07, pp.277-284, 2007.
DOI : 10.1145/1277548.1277586

B. D. Saunders and B. S. Youse, Large matrix, small rank, Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pp.317-324
DOI : 10.1145/1576702.1576746

D. Saunders, Matrices with Two Nonzero Entries per Row, Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC '15, pp.323-330, 2015.
DOI : 10.1145/2755996.2756679

C. The and . Team, CADO-NFS, an implementation of the number field sieve algorithm, 2015.

F. The and . Group, FFLAS-FFPACK: Finite Field Linear Algebra Subroutines / Package, 2014.

D. H. Wiedemann, Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory, vol.32, issue.1, pp.54-62, 1986.
DOI : 10.1109/TIT.1986.1057137