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

S. Gao and T. Mateer, Additive Fast Fourier Transforms Over Finite Fields, IEEE Transactions on Information Theory, vol.56, issue.12, pp.6265-6272, 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, 2013.
DOI : 10.1017/CBO9781139856065

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

D. Harvey, J. Van-der-hoeven, and G. Lecerf, Fast polynomial multiplication over F 2 60, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation , ISSAC '16, pp.255-262, 2016.
DOI : 10.1145/2930889.2930920
URL : https://hal.archives-ouvertes.fr/hal-01265278

D. Harvey, J. Van-der-hoeven, and G. Lecerf, Faster Polynomial Multiplication over Finite Fields, Journal of the ACM, vol.63, issue.6, p.2017
DOI : 10.1090/S0025-5718-1992-1106981-9
URL : https://hal.archives-ouvertes.fr/hal-01022757

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

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

J. Van-der-hoeven and R. Larrieu, The Frobenius FFT, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation , ISSAC '17, pp.437-444, 2017.
DOI : 10.1007/s10851-007-0013-x
URL : https://hal.archives-ouvertes.fr/hal-01453269

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, pp.363-370, 2013.
DOI : 10.1145/2465506.2465511
URL : https://hal.archives-ouvertes.fr/hal-00771214

J. Van-der-hoeven and G. Lecerf, Mathemagix User Guide, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00785549

R. Larrieu, The Truncated Fourier Transform for Mixed Radices, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation , ISSAC '17, pp.261-268, 2017.
DOI : 10.1007/BF02242355
URL : https://hal.archives-ouvertes.fr/hal-01419442

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, pp.316-325, 2014.
DOI : 10.1109/FOCS.2014.41
URL : http://arxiv.org/pdf/1404.3458

A. Schönhage, Fast multiplication of polynomials over fields of characteristic 2, Acta Informatica, vol.7, issue.4, pp.395-398, 1977.
DOI : 10.1007/BF00289470

A. Schönhage and V. Strassen, Fast multiplication of large numbers, Computing, vol.150, issue.3-4, pp.281-292, 1971.
DOI : 10.1007/BF02242355

H. S. Warren, Hacker's Delight, 2012.