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

E. R. Berlekamp, Nonbinary BCH decoding (Abstr.), IEEE Transactions on Information Theory, vol.14, issue.2, p.242, 1968.
DOI : 10.1109/TIT.1968.1054109

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

P. Bouvier, L. Gaudry, H. Imbert, E. Jeljeli, G. Beckermann et al., Discrete logarithms in GF(p) ? 180 digits Announcement to the NMBRTHRY list, item 003161 A uniform approach for the fast computation of matrix-type Padé approximants, Cop94] Don Coppersmith. Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm. Mathematics of Computation, pp.804-823333, 1994.

D. Coppersmith, A. M. Odlyzko, and R. Schroeppel, Discrete logarithms inGF(p), Algorithmica, vol.13, issue.1-4, pp.1-15, 1986.
DOI : 10.1007/BF01840433

A. Joux, R. Lercier, N. Smart, and F. Vercauteren, The Number Field Sieve in the Medium Prime Case, Advances in Cryptology- CRYPTO 2006, pp.326-344, 2006.
DOI : 10.1007/11818175_19
URL : https://hal.archives-ouvertes.fr/hal-01102034

A. Joux, A. Odlyzko, and C. Pierrot, The past, evolving present and future of discrete logarithm Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems, Open Problems in Mathematics and Computational Sciences, pp.5-36, 1995.

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

J. L. Massey, Shift-register synthesis and BCH decoding, IEEE Transactions on Information Theory, vol.15, issue.1, pp.122-127, 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 Proceedings, Part I, pp.156-170, 2015.
DOI : 10.1007/978-3-662-46800-5_7
URL : https://hal.archives-ouvertes.fr/hal-01056205

O. Schirokauer, Discrete logarithm and local units Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm, Philosophical Transactions of the Royal Society of London J. Symb. Comput, vol.33, issue.5, pp.409-423757, 1993.

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