L. Auslander, J. R. Johnson, and R. W. Johnson, An equivariant Fast Fourier Transform algorithm, 1996.

H. David and . Bailey, Ffts in external of hierarchical memory, Proceedings of the 1989 ACM/IEEE conference on Supercom puting, p.234242, 1989.

G. D. Bergland, A fast Fourier transform algorithm for real-valued series, Com munications of the ACM, vol.11, issue.10, p.703710, 1968.

R. Bergmann, The fast Fourier transform and fast wavelet transform for patterns on the torus Applied and Com putational Harmonic Analysis, 2012.

D. Blessenohl, On the normal basis theorem. Note di M atem atica, p.510, 2007.

I. Leo and . 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.

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

J. Zur-gathen and J. Gerhard, Modern Computer Algebra, 2013.
DOI : 10.1017/CBO9781139856065

C. F. Gauss, Nachlass: Theoria interpolationis methodo nova tractata, Werke, pp.265330-1866
DOI : 10.1007/978-3-642-49319-5_8

I. J. Good, The interaction algorithm and practical Fourier analysis, Journal of the Royal Statistical Society , Series B, vol.20, issue.2, p.361372, 1958.

A. Guessoum and R. Mersereau, Fast algorithms for the multidimensional discrete Fourier transform, IEEE Transactions on Acoustics, Speech, and Signal Processing, vol.34, issue.4, p.937943, 1986.
DOI : 10.1109/TASSP.1986.1164883

D. Harvey, J. Van-der-hoeven, and G. Lecerf, Fast polynomial multiplication over F 2 60, Proc. ISSAC '16, p.255262, 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 nite elds, J. ACM, vol.63, issue.6, p.2017
DOI : 10.1145/3005344
URL : http://arxiv.org/abs/1407.3361

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, Notes on the Truncated Fourier Transform, 2005.

J. Van-der-hoeven, R. Lebreton, and É. Schost, Structured FFT and TFT, Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation, ISSAC '13, p.355362, 2013.
DOI : 10.1145/2465506.2465526
URL : https://hal.archives-ouvertes.fr/hal-00780431

J. Van-der-hoeven and G. Lecerf, Modular composition via factorization
URL : https://hal.archives-ouvertes.fr/hal-01457074

J. Johnson and X. Xu, Generating symmetric DFTs and equivariant FFT algorithms, Proceedings of the 2007 international symposium on Symbolic and algebraic computation , ISSAC '07, 2007.
DOI : 10.1145/1277548.1277576

K. S. Kedlaya and C. Umans, Fast Polynomial Factorization and Modular Composition, SIAM Journal on Computing, vol.40, issue.6, p.17671802, 2011.
DOI : 10.1137/08073408X
URL : http://authors.library.caltech.edu/28972/1/Kedlaya2011p16787Siam_J_Comput.pdf

A. Kudlicki, M. Rowicka, and Z. Otwinowski, The crystallographic fast Fourier transform. Recursive symmetry reduction, Acta Crystallographica Section A Foundations of Crystallography, vol.63, issue.6, p.465480, 2007.
DOI : 10.1107/S0108767307047411

R. Larrieu, The truncated fourier transform for mixed radices
URL : https://hal.archives-ouvertes.fr/hal-01419442

J. Nicolas and G. Robin, Highly composite numbers by Srinivasa Ramanujan, T he Ram anujan Journal, vol.1, issue.2, p.119153, 1997.

C. H. Papadimitriou, Com putational Com plexity, 1994.

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

H. V. Sorensen, D. L. Jones, M. T. Heideman, and C. S. Burrus, Realvalued fast Fourier transform algorithm, IEEE Transactions on Acoustics, Speech and Signal Processing, vol.35, issue.6, p.849863, 1987.

L. F. Eyck, Crystallographic Fast Fourier Transform, Acta Cryst, vol.29, p.183191, 1973.

A. Vince and X. Zheng, Computing the Discrete Fourier Transform on a Hexagonal Lattice, Journal of Mathematical Imaging and Vision, vol.12, issue.2, p.125133, 2007.
DOI : 10.1007/s10851-007-0013-x