D. Bernstein, Removing redundancy in high precision Newton iteration Available from http, 2000.

D. Bernstein, Scaled remainder trees Available from https, 2004.

A. Borodin and R. T. Moenck, Fast modular transforms, Journal of Computer and System Sciences, vol.8, issue.3, p.366386, 1974.
DOI : 10.1016/S0022-0000(74)80029-2
URL : http://doi.org/10.1016/s0022-0000(74)80029-2

A. Bostan, G. Lecerf, and É. Schost, Tellegen's principle into practice, Proceedings of the 2003 international symposium on Symbolic and algebraic computation , ISSAC '03, p.3744, 2003.
DOI : 10.1145/860854.860870

A. Bostan and É. Schost, Polynomial evaluation and interpolation on special sets of points, Journal of Complexity, vol.21, issue.4, p.420446, 2005.
DOI : 10.1016/j.jco.2004.09.009

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

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

C. M. Fiduccia, Polynomial evaluation via the division algorithm the fast Fourier transform revisited, Proceedings of the fourth annual ACM symposium on Theory of computing , STOC '72, p.8893, 1972.
DOI : 10.1145/800152.804900

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

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

T. Granlund, GMP, the GNU multiple precision arithmetic library, 1991.

G. Hanrot, M. Quercia, and P. Zimmermann, The middle product algorithm I. speeding up the division and square root of power series, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00071921

D. Harvey and J. Van-der-hoeven, On the complexity of integer matrix multiplication
URL : https://hal.archives-ouvertes.fr/hal-01071191

D. Harvey, J. Van-der-hoeven, and G. Lecerf, Faster polynomial multiplication over nite elds
DOI : 10.1145/3005344

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

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

J. Van-der-hoeven and G. Lecerf, Faster FFTs in medium precision, 22nd Symposium on Computer Arithmetic (ARITH), p.7582, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01081743

R. T. Moenck and A. Borodin, Fast modular transforms via division, 13th Annual Symposium on Switching and Automata Theory (swat 1972), p.9096, 1972.
DOI : 10.1109/SWAT.1972.5

C. H. Papadimitriou, Computational Complexity, 1994.

P. The, . Group, . Bordeaux, . Pari, and . Gp, Software available from http, 2012.

J. M. Pollard, The fast Fourier transform in a finite field, Mathematics of Computation, vol.25, issue.114, p.365374, 1971.
DOI : 10.1090/S0025-5718-1971-0301966-0

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