M. Bodrato, Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0, Lecture Notes in Computer Science, vol.4547, pp.119-136, 2007.
DOI : 10.1007/978-3-540-73074-3_10

W. Bosma and J. Cannon, Handbook of Magma Functions, School of Mathematics and Statistics, 1995.

R. P. Brent, Search for primitive trinomials

R. P. Brent, S. Larvala, and P. Zimmermann, A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377, Mathematics of Computation, vol.72, issue.243, pp.1443-1452, 2003.
DOI : 10.1090/S0025-5718-02-01478-3
URL : https://hal.archives-ouvertes.fr/inria-00099744

R. P. Brent, S. Larvala, and P. Zimmermann, A primitive trinomial of degree 6972593, Mathematics of Computation, vol.74, issue.250, pp.1001-1002, 2005.
DOI : 10.1090/S0025-5718-04-01673-4
URL : https://hal.archives-ouvertes.fr/hal-00917727

D. G. Cantor and H. Zassenhaus, A new algorithm for factoring polynomials over finite fields, Mathematics of Computation, vol.36, issue.154, pp.587-592, 1981.
DOI : 10.1090/S0025-5718-1981-0606517-5

. Ph, X. Flajolet, D. Gourdon, and . Panario, The complete analysis of a polynomial factorization algorithm over finite fields Faster integer multiplication, preprint, Feb 19, J. of Algorithms, vol.40, pp.37-81, 2001.

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

J. Zur-gathen and J. Gerhard, Polynomial factorization over ${\mathbb F}_2$, Mathematics of Computation, vol.71, issue.240, pp.1677-1698, 2002.
DOI : 10.1090/S0025-5718-02-01421-7

J. Zur-gathen and V. Shoup, Computing Frobenius maps and factoring polynomials, computational complexity, vol.10, issue.2, pp.187-224, 1992.
DOI : 10.1007/BF01272074

T. Kumada, H. Leeb, Y. Kurita, and M. Matsumoto, New primitive $t$-nomials $(t = 3,5)$ over $GF(2)$ whose degree is a Mersenne exponent, Mathematics of Computation, vol.69, issue.230, pp.811-814, 2000.
DOI : 10.1090/S0025-5718-99-01168-0

A. Pellet, Sur la décomposition d'une fonctionentì ere en facteurs irréductibles suivant un module premier p, Comptes Rendus de l'Académie des, Sciences Paris, vol.86, pp.1071-1072, 1878.

J. M. Pollard, A monte carlo method for factorization, BIT, vol.29, issue.129, pp.331-334, 1975.
DOI : 10.1007/BF01933667

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, NTL: A library for doing number theory, Version 5.3.2

R. G. Swan, Factorization of polynomials over finite fields, Pacific Journal of Mathematics, vol.12, issue.3, pp.1099-1106, 1962.
DOI : 10.2140/pjm.1962.12.1099

G. Woltman, The Great Internet Mersenne Prime Search

L. Unité-de-recherche-inria-lorraine and . Technopôle-de-nancy, Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4, rue Jacques Monod -91893 ORSAY Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt, Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex (France) Unité de recherche INRIA Sophia Antipolis : 2004, route des Lucioles -BP 93 -06902 Sophia Antipolis Cedex