A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The design and analysis of computer algorithms, 1974.

B. Beckerman and G. Labahn, A Uniform Approach for the Fast Computation of Matrix-Type Pad?? Approximants, SIAM Journal on Matrix Analysis and Applications, vol.15, issue.3, pp.804-823, 1994.
DOI : 10.1137/S0895479892230031

R. R. Bitmead and B. D. Anderson, Asymptotically fast solution of toeplitz and related systems of linear equations, Linear Algebra and its Applications, vol.34, pp.103-116, 1980.
DOI : 10.1016/0024-3795(80)90161-5

S. Cavallar, Strategies in Filtering in the Number Field Sieve, Lecture Notes in Comput. Sci, vol.1838, pp.209-231, 2000.
DOI : 10.1007/10722028_11

S. Cavallar, Factorization of a 512-Bit RSA Modulus, Preneel, pp.1-18, 2000.
DOI : 10.1007/3-540-45539-6_1
URL : https://hal.archives-ouvertes.fr/inria-00099117

D. Coppersmith, Fast evaluation of logarithms in fields of characteristic two, IEEE Transactions on Information Theory, vol.30, issue.4, pp.587-594, 1984.
DOI : 10.1109/TIT.1984.1056941

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. Zur-gathen and J. Gerhard, Modern Computer Algebra, 1999.
DOI : 10.1017/CBO9781139856065

P. Gaudry, An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves, Preneel, pp.19-34, 2000.
DOI : 10.1007/3-540-45539-6_2
URL : https://hal.archives-ouvertes.fr/inria-00512401

P. Gaudry, Algorithmique des courbes hyperelliptiques et applicationsàapplications`applicationsà la cryptologie, Thèse, ´ Ecole Polytechnique, 2000.
URL : https://hal.archives-ouvertes.fr/tel-00514848

T. Granlund, GMP, the GNU multiple precision arithmetic library, 1996.

F. G. Gustavson and D. Y. Yun, Fast algorithms for rational Hermite approximation and solution of Toeplitz systems, IEEE Transactions on Circuits and Systems, vol.26, issue.9, pp.750-755, 1979.
DOI : 10.1109/TCS.1979.1084696

G. Hanrot, M. Quercia, and P. Zimmerman, Speeding up the division and square root of power series, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00072675

E. Kaltofen, Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems, Math. Comp, vol.64, issue.210, pp.777-806, 1995.

E. Kaltofen and A. Lobo, Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields, Algorithmica, vol.24, issue.3-4, pp.331-348, 1999.
DOI : 10.1007/PL00008266

E. Kaltofen and G. Villard, On the complexity of computing determinants, Proc. Fifth Asian Symposium on Computer Mathematics of Lectures Notes Series on Computing, pp.13-27, 2001.

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

A. Lobo, Matrix-free linear system solving and applications to symbolic computations, 1995.

P. L. Montgomery, A Block Lanczos Algorithm for Finding Dependencies over GF(2), Advances in Cryptology ? EUROCRYPT '95, pp.106-120, 1995.
DOI : 10.1007/3-540-49264-X_9

M. Morf, Doubling algorithms for Toeplitz and related equations, ICASSP '80. IEEE International Conference on Acoustics, Speech, and Signal Processing, pp.954-959, 1980.
DOI : 10.1109/ICASSP.1980.1171074

A. M. Odlyzko, Discrete logarithms in finite fields and their cryptographic significance, Advances in Cryptology ? EUROCRYPT '84, pp.224-314
DOI : 10.1007/3-540-39757-4_20

O. Penninga, Finding column dependencies in sparse matrices over F 2 by block Wiedemann Available from http, 1998.

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

J. Rissanen, I. Research, T. J. Watson-research, and . Center, Realizations of matrix sequences, 1972.

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

E. Thomé, Computation of Discrete Logarithms in $$ \mathbb{F}_{2^{607} } $$, Advances in Cryptology ? ASIACRYPT '2001, pp.107-124, 2001.
DOI : 10.1007/3-540-45682-1_7

E. Thomé, Discrete logarithms in GF(2 607 ) Email to the NMBRTHRY mailing list, 2002.

G. Villard, A study of Coppersmith's block Wiedemann algorithm using matrix polynomials, Research report LMC-IMAG, vol.975, 1997.

G. Villard, Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems (extended abstract), Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.32-39, 1997.
DOI : 10.1145/258726.258742

D. Weber and T. Denny, The solution of McCurley's discrete log challenge, Advances in Cryptology ? CRYPTO '98, pp.458-471, 1998.
DOI : 10.1007/BFb0055747

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