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

G. Baszenski and M. Tasche, Fast polynomial multiplication and convolutions related to the discrete cosine transform, Linear Algebra and its Applications, vol.252, issue.1-3, pp.1-25, 1997.
DOI : 10.1016/0024-3795(95)00696-6

D. J. Bernstein and J. P. Sorenson, Modular exponentiation via the explicit Chinese remainder theorem, Mathematics of Computation, vol.76, issue.257, pp.443-454, 2007.
DOI : 10.1090/S0025-5718-06-01849-7

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

T. Granlund, GNU MP: The GNU Multiple Precision Arithmetic Library

P. L. Montgomery, Modular multiplication without trial division, Mathematics of Computation, vol.44, issue.170, pp.519-521, 1985.
DOI : 10.1090/S0025-5718-1985-0777282-X

P. Montgomery, Speeding the Pollard and elliptic curve methods of factorization, Mathematics of Computation, vol.48, issue.177, pp.243-264, 1987.
DOI : 10.1090/S0025-5718-1987-0866113-7

P. L. Montgomery and R. D. Silverman, An FFT Extension to the P ? 1 Factoring Algorithm, Math. Comp, vol.54, pp.839-854, 1990.

P. L. Montgomery, An FFT Extension to the Elliptic Curve Method of Factorization, UCLA dissertation, 1992.

H. J. Nussbaumer, Fast Fourier Transform and Convolution Algorithms, 1982.
DOI : 10.1007/978-3-662-00551-4

J. M. Pollard, Theorems on factorization and primality testing, Proc. Cambridge Philosophical Society, pp.521-528, 1974.
DOI : 10.2307/2003473

H. C. Williams, A p + 1 Method of Factoring, Mathematics of Computation, vol.39, issue.159, pp.225-234, 1982.
DOI : 10.2307/2007633

P. Zimmermann and B. Dodson, 20 Years of ECM, Algorithmic Number Theory, 7th International Symposium, ANTS?VII, pp.525-542, 2006.
DOI : 10.1007/11792086_37

URL : https://hal.archives-ouvertes.fr/inria-00070192