L. M. Adleman and H. W. Lenstra-jr, Finding irreducible polynomials over finite fields, Proceedings of the eighteenth annual ACM symposium on Theory of computing , STOC '86, pp.350-355, 1986.
DOI : 10.1145/12130.12166

L. M. Adleman, C. Pomerance, and R. S. Rumely, On Distinguishing Prime Numbers from Composite Numbers, The Annals of Mathematics, vol.117, issue.1, pp.173-206, 1983.
DOI : 10.2307/2006975

A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The design and analysis of computer algorithms, 1974.

R. C. Baker, G. Harman, and J. Pintz, The Difference Between Consecutive Primes, II, Proc. London Math. Soc. (3), pp.532-562, 2001.
DOI : 10.1112/plms/83.3.532

L. I. Bluestein, A linear filtering approach to the computation of discrete Fourier transform, IEEE Transactions on Audio and Electroacoustics, vol.18, issue.4, pp.451-455, 1970.
DOI : 10.1109/TAU.1970.1162132

L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and real computation, 1998.
DOI : 10.1007/978-1-4612-0701-6

A. Bostan, P. Gaudry, and É. Schost, Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier???Manin Operator, SIAM Journal on Computing, vol.36, issue.6, pp.1777-1806, 2007.
DOI : 10.1137/S0097539704443793
URL : https://hal.archives-ouvertes.fr/inria-00103401

R. P. Brent, Fast Multiple-Precision Evaluation of Elementary Functions, Journal of the ACM, vol.23, issue.2, pp.242-251, 1976.
DOI : 10.1145/321941.321944

P. Bürgisser, M. Clausen, and M. A. Shokrollahi, Algebraic complexity theory, 1997.
DOI : 10.1007/978-3-662-03338-8

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

R. Crandall and B. Fagin, Discrete weighted transforms and large-integer arithmetic, Mathematics of Computation, vol.62, issue.205, pp.305-324, 1994.
DOI : 10.1090/S0025-5718-1994-1185244-1

M. Frigo and S. G. Johnson, The Design and Implementation of FFTW3, Proc. IEEE, pp.216-231, 2005.
DOI : 10.1109/JPROC.2004.840301

M. Fürer, Faster integer multiplication, Proceedings of the Thirty-Ninth ACM Symposium on Theory of Computing, STOC 2007, pp.57-66, 2007.

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

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

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

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

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

D. E. Knuth, The art of computer programming Sorting and Searching, 1998.

H. W. Lenstra and J. , On Artin's conjecture and Euclid's algorithm in global fields, Inventiones Mathematicae, vol.15, issue.275, pp.201-224, 1977.
DOI : 10.1007/BF01389788

P. Moree, On Primes in Arithmetic Progression Having a Prescribed Primitive Root, Journal of Number Theory, vol.78, issue.1, pp.85-98, 1999.
DOI : 10.1006/jnth.1999.2409

P. Moree, Abstract., Integers, vol.12, issue.6, pp.1305-1416, 2012.
DOI : 10.1515/integers-2012-0043

C. H. Papadimitriou, Computational Complexity, 1994.

J. Pieltant and H. Randriam, New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields, Mathematics of Computation, vol.84, issue.294, 2014.
DOI : 10.1090/S0025-5718-2015-02921-4
URL : https://hal.archives-ouvertes.fr/hal-00828153

C. Pomerance, Recent developments in primality testing, The Mathematical Intelligencer, vol.31, issue.21, pp.97-10581, 1980.
DOI : 10.1007/BF03022861

C. M. Rader, Discrete Fourier transforms when the number of data samples is prime, Proc. IEEE, pp.1107-1108, 1968.
DOI : 10.1109/PROC.1968.6477

K. R. Rao, D. N. Kim, and J. J. Hwang, Fast Fourier Transform -Algorithms and Applications. Signals and Communication Technology, 2010.

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

V. Shoup, New algorithms for finding irreducible polynomials over finite fields, Math. Comp, vol.189, pp.435-447, 1990.

V. Shoup, Searching for primitive roots in finite fields, Mathematics of Computation, vol.58, issue.197, pp.369-380, 1992.
DOI : 10.1090/S0025-5718-1992-1106981-9

S. Wagstaff, Divisors of Mersenne numbers, Mathematics of Computation, vol.40, issue.161, pp.385-397, 1983.
DOI : 10.1090/S0025-5718-1983-0679454-X

L. C. Washington, Introduction to cyclotomic fields, Graduate Texts in Mathematics, vol.83, 1997.