L. Adleman, A subexponential algorithm for the discrete logarithm problem with applications to cryptography, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 1979.
DOI : 10.1109/SFCS.1979.2

E. R. Berlekamp, Nonbinary BCH decoding IEEE Transactions on Information Theory, 1968.

R. Barbulescu and P. Gaudry, Aurore Guillevic and François Morain, Improvements to the number field sieve for non-prime finite fields, INRIA Hal Archive, 2014.

C. Bouvier, P. Gaudry, L. Imbert, H. Jeljeli, and E. Thomé, Discrete logarithms in GF(p) ? 180 digits, 2014.

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

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

D. Coppersmith, A. Odlyzko, and R. Schroeppel, Discrete Logarithms in GF(p). Algorithmica, 1986.

D. Coppersmith and S. Winograd, Matrix Multiplication via Arithmetic Progressions, Journal of Symbolic Computation, 1990.

P. Giorgi, C. Jeannerod, and G. Villard, On the complexity of polynomial matrix computations. Symbolic and Algebraic Computation , International Symposium ISSAC, 2003.

A. Joux, R. Lercier, N. Smart, and F. Vercauteren, The number field sieve in the medium prime case Advances in Cryptology- CRYPTO, 2006.

A. Joux, A. Odlyzko, and C. Pierrot, The Past, Evolving Present, and Future of the Discrete Logarithm, Open Problems in Mathematics and Computational Sciences C. K. Koc, 2014.
DOI : 10.1007/978-3-319-10683-0_2

E. Kaltofen, Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems, Mathematics of Computation, 1995.

E. Kaltofen and D. Saunders, On Wiedemann's Method of Solving Sparse Linear Systems Applied Algebra, Algebraic Algorithms and Error- Correcting Codes, 1991.

L. François and . Gall, Powers of tensors and fast matrix multiplication, International Symposium on Symbolic and Algebraic Computation, 2014.

K. Arjen, H. W. Lenstra, and J. Lenstra, The development of the number field sieve, Lecture Notes in Mathematics, 1993.

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

C. Pierrot, The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods, Advances in Cryptology -EUROCRYPT 2015 -34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2015.
DOI : 10.1007/978-3-662-46800-5_7
URL : https://hal.archives-ouvertes.fr/hal-01056205

O. Schirokauer, Discrete logarithms and local units, Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences, vol.345, issue.1676, 1993.
DOI : 10.1098/rsta.1993.0139

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

H. Douglas, Wiedemann Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory, 1986.