M. Agrawal, N. Kayal, and N. Saxena, PRIMES is in P, Annals of Mathematics, vol.160, issue.2, p.781793, 2004.
DOI : 10.4007/annals.2004.160.781

A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, 1974.

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

J. Berthomieu, J. Van-der-hoeven, and G. Lecerf, Relaxed algorithms for p-adic numbers, Journal de Th??orie des Nombres de Bordeaux, vol.23, issue.3, p.541577, 2011.
DOI : 10.5802/jtnb.777
URL : https://hal.archives-ouvertes.fr/hal-00486680

J. Berthomieu and R. Lebreton, Relaxed p-adic Hensel lifting for algebraic systems, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, p.5966, 2012.
DOI : 10.1145/2442829.2442842
URL : https://hal.archives-ouvertes.fr/hal-00660566

D. Bini and V. Y. Pan, Polynomial and matrix computations, Birkhäuser Boston Inc, vol.1, 1994.
DOI : 10.1007/978-1-4612-0265-3

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.

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

R. P. Brent and H. T. Kung, Fast Algorithms for Manipulating Formal Power Series, Journal of the ACM, vol.25, issue.4, pp.581-595, 1978.
DOI : 10.1145/322092.322099

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

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. 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

M. J. Fischer and L. J. Stockmeyer, Fast on-line integer multiplication, Proceedings of the fifth annual ACM symposium on Theory of computing , STOC '73, p.6772, 1974.
DOI : 10.1145/800125.804037

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

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

J. Van-der-hoeven, Lazy multiplication of formal power series, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, p.1720, 1997.
DOI : 10.1145/258726.258738

J. Van-der-hoeven, Relax, but Don???t be Too Lazy, Journal of Symbolic Computation, vol.34, issue.6, p.479542, 2002.
DOI : 10.1006/jsco.2002.0562

J. Van-der-hoeven, Relaxed multiplication using the middle product, Proc. ISSAC '03, p.143147, 2003.

]. 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, New algorithms for relaxed multiplication, Journal of Symbolic Computation, vol.42, issue.8, p.792802, 2007.
DOI : 10.1016/j.jsc.2007.04.004

J. Van-der-hoeven and H. , Relaxed resolution of implicit equations, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00441977

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, From implicit to recursive equations, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00583125

A. Karatsuba and J. Ofman, Multiplication of multidigit numbers on automata, Soviet Physics Doklady, vol.7, p.595596, 1963.

R. Lebreton and É. Schost, A simple and fast online power series multiplication and its analysis, Journal of Symbolic Computation, vol.72, 2013.
DOI : 10.1016/j.jsc.2015.03.001
URL : https://hal.archives-ouvertes.fr/lirmm-00867279

L. R. Rabiner, R. W. Schafer, and C. M. Rader, The Chirp z-Transform Algorithm and Its Application, Bell System Technical Journal, vol.48, issue.5, p.12491292, 1969.
DOI : 10.1002/j.1538-7305.1969.tb04268.x

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

A. Sedoglavic, Méthodes seminumériques en algèbre différentielle ; applications à l'étude des propriétés structurelles de systèmes différentiels algébriques en automatique, 2001.

V. Shoup, New algorithms for nding irreducible polynomials over nite elds, Math. Comp, vol.54, p.535447, 1990.

V. Shoup, Searching for primitive roots in nite elds, Math. Comp, vol.58, p.369380, 1992.

I. Shparlinski, On primitive elements in nite elds and on elliptic curves, p.11961206, 1990.

A. L. Toom, The complexity of a scheme of functional elements realizing the multiplication of integers, Soviet Mathematics, vol.4, issue.2, p.714716, 1963.