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

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.3-804, 1994.
DOI : 10.1137/S0895479892230031

R. R. Bitmead, A. , and B. D. , 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, ANTS-IV, pp.209-231, 2000.
DOI : 10.1007/10722028_11

S. Cavallar, B. Dodson, A. K. Lenstra, W. Lioen, P. L. Montgomery et al., Factorization of a 512-Bit RSA Modulus, Preneel [21], pp.1-18
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

URL : http://doi.org/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, G. , and J. , Modern Computer Algebra, 1999.
DOI : 10.1017/CBO9781139856065

P. Gaudry, An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves, Preneel [21], pp.19-34
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

F. G. Gustavson, Y. , and D. Y. , 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

E. Kaltofen, Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems, Math. Comp, vol.64, pp.210-777, 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

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

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, 1985.
DOI : 10.1007/3-540-39757-4_20

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

B. Preneel and . Ed, Advances in Cryptology ? EURO- CRYPT, Lecture Notes in Comput. Sci, vol.1807, 2000.

J. Teitelbaum, Euclid's algorithm and the Lanczos method over finite fields, Mathematics of Computation, vol.67, issue.224, pp.1665-1678, 1998.
DOI : 10.1090/S0025-5718-98-00973-9

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

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

D. Weber, D. , and T. , 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