K. Aoki, J. Franke, T. Kleinjung, A. Lenstra, and D. A. Osvik, A Kilobit Special Number Field Sieve Factorization, ASIACRYPT 2007, pp.1-12, 2007.

M. Bodrato, Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0, WAIFI 2007, pp.116-133, 2007.

R. P. Brent and P. Zimmermann, A multi-level blocking distinct-degree factorization algorithm, Research Report INRIA, vol.6331, 2007.

D. G. Cantor, On arithmetical algorithms over finite fields, Journal of Combinatorial Theory, Series A, vol.50, issue.2, pp.285-300, 1989.

F. Chabaud and R. Lercier, ZEN, a toolbox for fast computation in finite extensions over finite rings

H. Cohen, G. Frey, R. Avanzi, C. Doche, T. Lange et al., Handbook of Elliptic and Hyperelliptic Curve Cryptography, Discrete Mathematics and its Applications, 2005.

S. A. Cook, On the minimum computation time of functions, Transactions of the American Mathematical Society, vol.142, 1966.

J. Zur-gathen and J. Gerhard, Arithmetic and factorization of polynomials over F2, Proceedings of ISSAC 1996, pp.1-9, 1996.

J. Zur-gathen and J. Gerhard, Polynomial factorization over ${\mathbb F}_2$, Mathematics of Computation, vol.71, issue.240, pp.1677-1698, 2002.

P. Gaudry, A. Kruppa, and P. Zimmermann, A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm, Proceedings of IS- SAC 2007, pp.167-174, 2007.

P. Gaudry and E. Thomé, The mpFq library and implementing curve-based key exchanges, Proceedings of SPEED, pp.49-64, 2007.

D. Hankerson, A. J. Menezes, and S. Vanstone, Guide to Elliptic Curve Cryptography, 2004.

D. Harvey, Avoiding expensive scalar divisions in the Toom-3 multiplication algorithm, p.10, 2007.

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.

L. The, . Group, and . Lidia, A C++ Library For Computational Number Theory, Version 2, 2006.

P. L. Montgomery, Five, six, and seven-term Karatsuba-like formulae, IEEE Transactions on Computers, vol.54, issue.3, pp.362-369, 2005.

P. Roelse, Factoring high-degree polynomials over $\mathbf F_2$ with Niederreiter's algorithm on the IBM SP2, Mathematics of Computation, vol.68, issue.226, pp.869-880, 1999.

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

V. Shoup, NTL: A library for doing number theory, Version 5, 2007.

E. Thomé, Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm, Journal of Symbolic Computation, vol.33, issue.5, pp.757-775, 2002.

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

A. Weimerskirch, D. Stebila, and S. C. Shantz, Generic GF(2m) Arithmetic in Software and Its Application to ECC, ACISP 2003, pp.79-92, 2003.

P. Zimmermann, Irred-ntl patch