J. P. Boyd, Chebyshev and Fourier Spectral Methods, 2001.
DOI : 10.1007/978-3-642-83876-7

Z. Battles and L. Trefethen, An extension of matlab to continuous fractions and operators, SIAM J. Sci. Comp, 2004.

N. Brisebarre and M. Jolde¸sjolde¸s, Chebyshev interpolation polynomial-based tools for rigorous computing, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, pp.147-154, 2010.
DOI : 10.1145/1837934.1837966
URL : https://hal.archives-ouvertes.fr/ensl-00472509

A. Karatsuba and Y. Ofman, Multiplication of multidigit numbers on automata, Doklady Akademii Nauk SSSR, vol.145, issue.2, pp.293-294, 1962.

A. L. Toom, The complexity of a scheme of functional elements realizing the multiplication of integers, Soviet Math, vol.3, pp.714-716, 1963.

S. A. Cook, On the minimum computation time of functions, Transactions of the American Mathematical Society, vol.142, 1966.
DOI : 10.1090/S0002-9947-1969-0249212-8

J. Cooley and J. 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

J. V. Gathen and J. Gerhard, Modern Computer Algebra, 2003.

R. Brent and P. Zimmermann, Modern Computer Arithmetic, 2010.
DOI : 10.1017/CBO9780511921698
URL : https://hal.archives-ouvertes.fr/cel-01500109

D. G. Cantor and E. Kaltofen, On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, vol.7, issue.7, pp.693-701, 1991.
DOI : 10.1007/BF01178683

J. B. Lima, D. Panario, and Q. Wang, A Karatsuba-Based Algorithm for Polynomial Multiplication in Chebyshev Form, IEEE Transactions on Computers, vol.59, issue.6, pp.835-841, 2010.
DOI : 10.1109/TC.2010.45

A. Bostan, B. Salvy, and E. Schost, Power series composition and change of basis, Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, ISSAC '08, pp.269-276, 2008.
DOI : 10.1145/1390768.1390806
URL : https://hal.archives-ouvertes.fr/inria-00273385

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

S. Johnson and M. Frigo, A Modified Split-Radix FFT With Fewer Arithmetic Operations, IEEE Transactions on Signal Processing, vol.55, issue.1, pp.111-119, 2007.
DOI : 10.1109/TSP.2006.882087

H. Sorensen, D. Jones, M. Heideman, and C. Burrus, Real-valued fast Fourier transform algorithms, IEEE Transactions on Acoustics, Speech, and Signal Processing, vol.35, issue.6, pp.849-863, 1987.
DOI : 10.1109/TASSP.1987.1165220

G. Baszenski and M. Tasche, Fast polynomial multiplication and convolutions related to the discrete cosine transform, Linear Algebra and its Application, pp.1-25, 1997.
DOI : 10.1016/0024-3795(95)00696-6

S. C. Chan and K. L. Ho, Direct methods for computing discrete sinusoidal transforms Radar and Signal Processing, IEE Proceedings F, vol.137, issue.6, pp.433-442, 1990.

P. Giorgi, On Polynomial Multiplication in Chebyshev Basis, IEEE Transactions on Computers, vol.61, issue.6, 2010.
DOI : 10.1109/TC.2011.110
URL : https://hal.archives-ouvertes.fr/hal-00520207

D. R. Musser, G. J. Derge, and A. Saini, The STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library, 2002.

M. Püschel, J. M. Moura, J. Johnson, D. Padua, M. Veloso et al., SPIRAL: Code Generation for DSP Transforms, Proceedings of the IEEE special issue on " Program Generation, Optimization, and Platform Adaptation, pp.232-275, 2005.
DOI : 10.1109/JPROC.2004.840306

M. Frigo and S. G. Johnson, The Design and Implementation of FFTW3, Program Generation, Optimization, and Platform Adaptation, pp.216-231, 2005.
DOI : 10.1109/JPROC.2004.840301

N. J. Higham, Accuracy and Stability of Numerical Algorithms, 2002.
DOI : 10.1137/1.9780898718027

R. Lidl and H. Niederreiter, Finite fields, 1997.
DOI : 10.1017/CBO9780511525926

A. Hasan and C. Negre, Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation, IEEE Transactions on Computers, vol.60, issue.4, 2010.
DOI : 10.1109/TC.2010.132
URL : https://hal.archives-ouvertes.fr/hal-00813621

J. B. Lima, D. Panario, R. Campello, and . Souza, Public-key encryption based on chebyshev polynomials over gf(q), Information Processing Letters, vol.11, issue.2, pp.51-56, 2010.

D. Harvey and D. S. Roche, An in-place truncated fourier transform and applications to polynomial multiplication, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, 2010.
DOI : 10.1145/1837934.1837996