S. Ballet and J. Pieltant, On the tensor rank of multiplication in any extension of F 2, J. Complexity, vol.27, issue.2, p.230245, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00828053

L. I. Bluestein, A linear ltering approach to the computation of discrete Fourier transform, IEEE Transactions on Audio and Electroacoustics, vol.18, issue.4, p.451455, 1970.

M. Bodrato, Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0, Arithmetic of Finite Fields, p.116133, 2007.
DOI : 10.1007/978-3-540-73074-3_10

R. P. Brent, P. Gaudry, E. Thomé, and P. Zimmermann, Faster multiplication in GF, Algorithmic Number Theory, p.153166, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00188261

J. W. Cooley and J. W. Tukey, An algorithm for the machine calculation of complex Fourier series, Mathematics of Computation, vol.19, issue.90, p.297301, 1965.
DOI : 10.1090/S0025-5718-1965-0178586-1

R. Crandall and B. Fagin, Discrete weighted transforms and large-integer arithmetic, Mathematics of Computation, vol.62, issue.205, p.305324, 1994.
DOI : 10.1090/S0025-5718-1994-1185244-1

A. De, P. P. Kurur, C. Saha, and R. Saptharishi, Fast integer multiplication using modular arithmetic, SIAM J. Comput, vol.42, issue.2, p.685699, 2013.

P. Duhamel and M. Vetterli, Fast Fourier Transforms, Signal Processing, vol.19, issue.4, p.259299, 1990.
DOI : 10.1201/9781420046076-c7

A. Fog, Instruction tables. Lists of instruction latencies, throughputs and micro-operation breakdowns for Intel, AMD and VIA CPUs. Number 4 in Optimization manuals, 19962016.

M. Frigo and S. G. Johnson, The Design and Implementation of FFTW3, Proc. IEEE, p.216231, 2005.
DOI : 10.1109/JPROC.2004.840301

M. Fürer, Faster integer multiplication, Proceedings of the Thirty-Ninth ACM Symposium on Theory of Computing, STOC 2007, p.5766, 2007.

M. Fürer, Faster integer multiplication, SIAM J. Comp, vol.39, issue.3, p.9791005, 2009.

S. Gao and T. Mateer, Additive fast Fourier transforms over nite elds, IEEE Trans. Inform. Theory, vol.56, issue.12, p.62656272, 2010.
DOI : 10.1109/tit.2010.2079016
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.189.1352

J. Zur-gathen and J. Gerhard, Modern computer algebra, 2003.
DOI : 10.1017/CBO9781139856065

G. and T. Gnu-compiler-collection, Software available at http://gcc.gnu.org, from, 1987.

W. M. Gentleman and G. Sande, Fast Fourier Transforms, Proceedings of the November 7-10, 1966, fall joint computer conference on XX, AFIPS '66 (Fall), pp.66-563578, 1966.
DOI : 10.1145/1464291.1464352

I. J. Good, The interaction algorithm and practical Fourier analysis, the GNU multiple precision arithmetic library, J. R. Stat. Soc. Ser. B, vol.20, issue.2, p.361372, 1958.

W. Hart, Fast Library for Number Theory, 2008.

D. Harvey, J. Van-der-hoeven, and G. Lecerf, Even faster integer multiplication, Journal of Complexity, vol.36, 2014.
DOI : 10.1016/j.jco.2016.03.001
URL : https://hal.archives-ouvertes.fr/hal-01022749

D. Harvey, J. Van-der-hoeven, and G. Lecerf, Faster polynomial multiplication over nite elds, 2014.

J. Van-der-hoeven, The truncated fourier transform and applications, Proceedings of the 2004 international symposium on Symbolic and algebraic computation , ISSAC '04, p.290296, 2004.
DOI : 10.1145/1005285.1005327

J. Van-der-hoeven, Newton???s method and FFT trading, Journal of Symbolic Computation, vol.45, issue.8, p.857878, 2010.
DOI : 10.1016/j.jsc.2010.03.005

J. Van-der-hoeven and G. Lecerf, Interfacing mathemagix with C++, Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation, ISSAC '13, p.363370, 2013.
DOI : 10.1145/2465506.2465511
URL : https://hal.archives-ouvertes.fr/hal-00771214

S. Lin, W. Chung, and S. Han, Novel Polynomial Basis and Its Application to Reed-Solomon Erasure Codes, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, p.316325, 2014.
DOI : 10.1109/FOCS.2014.41

C. Lüders, Implementation of the DKSS Algorithm for Multiplication of Large Numbers, Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC '15, p.267274, 2015.
DOI : 10.1145/2755996.2756643

L. Meng and J. Johnson, High performance implementation of the TFT, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, p.328334, 2014.
DOI : 10.1145/2608628.2608661

J. M. Pollard, The fast Fourier transform in a nite eld, Math. Comp, vol.25, issue.114, p.365374, 1971.

C. M. Rader, Discrete Fourier transforms when the number of data samples is prime, Proc. IEEE, p.11071108, 1968.
DOI : 10.1109/PROC.1968.6477

A. Schönhage, Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2, Acta Infor, vol.7, issue.4, p.395398, 1977.

A. Schönhage and V. Strassen, Schnelle Multiplikation groÿer Zahlen, Computing, vol.7, p.281292, 1971.

V. Shoup, NTL: A Library for doing Number Theory , 2015. Software, version 9

L. H. Thomas, Using a computer to solve problems in physics, Applications of digital computers, p.4257, 1963.

S. Winograd, On computing the Discrete Fourier Transform, Proceedings of the National Academy of Sciences, vol.73, issue.4, p.175199, 1978.
DOI : 10.1073/pnas.73.4.1005