]. L. Adl94 and . Adleman, The function field sieve, Algorithmic Number Theory 1st Algorithmic Number Theory Symposium -Cornell University, pp.108-121, 1994.

M. Leonard, . Adleman, A. Ming-deh, and . Huang, Function field sieve method for discrete logarithms over finite fields, Inf. Comput, vol.151, issue.12, pp.5-16, 1999.

A. Bostan and . Schost, Polynomial evaluation and interpolation on special sets of points [Cop84] D. Coppersmith. Fast evaluation of logarithms in fields of characteristic two. Information Theory, Cop94] D. Coppersmith. Solving linear equations over GF(2) via block Wiedemann algorithm, pp.420-446587, 1984.

A. Commeine and I. Semaev, An Algorithm to Solve the Discrete Logarithm Problem with the Number Field Sieve, Public key cryptography?PKC, pp.174-190, 2006.
DOI : 10.1007/11745853_12

Q. Cheng, D. [. Wan, D. Cheng, and . Wan, On the list and bounded distance decodibility of Reed- Solomon codes On the list and bounded distance decodibility of Reed-Solomon codes, Foundations of Computer Science Proceedings. 45th Annual IEEE Symposium on, pp.335-341195, 2004.

N. Chen and Z. Yan, Complexity Analysis of Reed-Solomon Decoding over GF without Using Syndromes, EURASIP Journal on Wireless Communications and Networking, vol.137, issue.2, 2008.
DOI : 10.1049/ip-com:20050022

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

S. Gao, A New Algorithm for Decoding Reed-Solomon Codes, Communications, Information and Network Security, pp.55-68, 2002.
DOI : 10.1007/978-1-4757-3789-9_5

P. Gaudry, [. Zur-gathen, and J. Gerhard, Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem, Journal of Symbolic Computation, vol.44, issue.12, pp.1690-1702, 1999.
DOI : 10.1016/j.jsc.2008.08.005
URL : https://hal.archives-ouvertes.fr/inria-00337631

R. Granger, A. J. Holt, D. Page, N. P. Smart, F. Vercauteren et al., Function field sieve in characteristic three Discrete logarithms in GF(p) using the number field sieve, Algorithmic Number Theory 6th International Symposium, ANTS-VI Proceedings. [Gor93], pp.223-234124, 1993.

R. Granger and F. Vercauteren, On the Discrete Logarithm Problem on Algebraic Tori, Advances in Cryptology (CRYPTO 2005), pp.66-85, 2005.
DOI : 10.1007/11535218_5

V. Guruswami, A. [. Vardy, R. Joux, and . Lercier, Information Theory The function field sieve is quite special Joux and R. Lercier. Improvements to the general number field sieve for discrete logarithms in prime fields. a comparison with the gaussian integer method Joux and R. Lercier. The function field in the medium prime case, Algorihmic Number Theory 5th International Symposium, ANTS-V Proceedings. [JL03] A Advances in Cryptology ? EUROCRYPT, pp.512249-2256, 2002.

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
DOI : 10.1007/11818175_19
URL : https://hal.archives-ouvertes.fr/hal-01102034

S. Berlin, /. Heidelbergmon95, and ]. P. Montgomery, A block Lanczos algorithm for finding dependencies over GF(2), Advances in Cryptology ? EUROCRYPT '95 International Conference on the Theory and Application of Cryptographic Techniques Proceedings. [Rot06], pp.106-120, 1995.

R. Roth, Introduction to Coding Theory Discrete logarithms and local units Virtual logarithms An algorithm for evaluation of discrete logarithms in some nonprime finite fields, Philos. Trans. Roy. Soc. London Ser. A J. Algorithms Math. Comp, vol.345, issue.57224, pp.409-423140, 1676.

Y. Sugiyama, M. Kasahara, S. Hirawawa, and T. Namekawa, A method for solving key equation for decoding goppa codes, Information and Control, vol.27, issue.1, pp.87-99, 1975.
DOI : 10.1016/S0019-9958(75)90090-X

M. Sudanswa62 and ]. R. Swan, Decoding of Reed-Solomon codes beyond the error-correction bound Factorization of polynomials over finite fields, J. Complexity Pacific J. Math, vol.13, issue.12, pp.180-1931099, 1962.

O. Schirokauer, D. Weber, and T. F. Denny, Discrete logarithms: The effectiveness of the index calculus method, Algorithmic Number Theory, volume 1122 of Lecture Notes in Comput. Sci. Second International Symposium Proceedings. [Web96] D. Weber Algorithmic Number Theory Second International Symposium, ANTS- II, pp.337-361, 1996.
DOI : 10.1007/3-540-61581-4_66