A Kilobit Special Number Field Sieve Factorization, ASIACRYPT 2007, pp.1-12, 2007. ,
DOI : 10.1007/978-3-540-76900-2_1
Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0, WAIFI 2007, pp.116-133, 2007. ,
DOI : 10.1007/978-3-540-73074-3_10
A multi-level blocking distinct-degree factorization algorithm, Research Report INRIA, vol.6331, 2007. ,
DOI : 10.1090/conm/461/08982
URL : https://hal.archives-ouvertes.fr/inria-00187614
On arithmetical algorithms over finite fields, Journal of Combinatorial Theory, Series A, vol.50, issue.2, pp.285-300, 1989. ,
DOI : 10.1016/0097-3165(89)90020-4
ZEN, a toolbox for fast computation in finite extensions over finite rings ,
Handbook of Elliptic and Hyperelliptic Curve Cryptography, Discrete Mathematics and its Applications, 2005. ,
DOI : 10.1201/9781420034981
On the minimum computation time of functions, Transactions of the American Mathematical Society, vol.142, 1966. ,
DOI : 10.1090/S0002-9947-1969-0249212-8
Arithmetic and factorization of polynomials over F2, Proceedings of ISSAC 1996, pp.1-9, 1996. ,
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
A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm, Proceedings of IS- SAC 2007, pp.167-174, 2007. ,
The mpFq library and implementing curve-based key exchanges, Proceedings of SPEED, pp.49-64, 2007. ,
URL : https://hal.archives-ouvertes.fr/inria-00168429
Guide to Elliptic Curve Cryptography, 2004. ,
Avoiding expensive scalar divisions in the Toom-3 multiplication algorithm, p.10, 2007. ,
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
A C++ Library For Computational Number Theory, Version 2, 2006. ,
Five, six, and seven-term Karatsuba-like formulae, IEEE Transactions on Computers, vol.54, issue.3, pp.362-369, 2005. ,
DOI : 10.1109/TC.2005.49
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.182.6801
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. ,
DOI : 10.1090/S0025-5718-99-01008-X
Fast multiplication of polynomials over fields of characteristic 2, Acta Informatica, vol.7, issue.4, pp.395-398, 1977. ,
DOI : 10.1007/BF00289470
NTL: A library for doing number theory, Version 5, 2007. ,
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. ,
DOI : 10.1006/jsco.2002.0533
The complexity of a scheme of functional elements realizing the multiplication of integers, Soviet Mathematics, vol.3, pp.714-716, 1963. ,
Generic GF(2m) Arithmetic in Software and Its Application to ECC, ACISP 2003, pp.79-92, 2003. ,
DOI : 10.1007/3-540-45067-X_8
Irred-ntl patch ,