J. Arndt, Algorithms for programmers (working title) Draft version of, 2007.

D. Bailey, The computation of ? to 29,360,000 decimal digits using Borwein's quartically convergent algorithm, Math. Comp, vol.50, pp.283-296, 1988.

D. Bailey, FFTs in external or hierarchical memory, The Journal of Supercomputing, vol.5, issue.1, pp.23-35, 1990.
DOI : 10.1007/BF00162341

D. J. Bernstein, Multidigit multiplication for mathematicians, 2001.

D. J. Bernstein, Fast multiplication and its applications, 2004.

D. J. Bernstein, Removing redundancy in high-precision Newton iteration, 2004.

R. P. Brent, MULTIPLE-PRECISION ZERO-FINDING METHODS AND THE COMPLEXITY OF ELEMENTARY FUNCTION EVALUATION, Analytic Computational Complexity, pp.151-176, 1975.
DOI : 10.1016/B978-0-12-697560-4.50014-9

R. P. Brent and J. M. Pollard, Factorization of the eighth Fermat number, Mathematics of Computation, vol.36, issue.154, pp.627-630, 1981.
DOI : 10.1090/S0025-5718-1981-0606520-5

E. Brockmeyer, C. Ghez, J. D-'eer, F. Catthoor, M. et al., Parametrizable behavioral IP module for a data-localized low-power FFT, 1999 IEEE Workshop on Signal Processing Systems. SiPS 99. Design and Implementation (Cat. No.99TH8461), pp.635-644, 1999.
DOI : 10.1109/SIPS.1999.822370

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

R. Crandall and C. Pomerance, Prime Numbers: A Computational Perspective, 2000.
DOI : 10.1007/978-1-4684-9316-0

A. H. Karp and P. Markstein, High-precision division and square root, ACM Transactions on Mathematical Software, vol.23, issue.4, pp.561-589, 1997.
DOI : 10.1145/279232.279237
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.1679

D. Knuth, The analysis of algorithms, Actes du Congrès International des Mathématiciens de, pp.269-274, 1970.

R. Moenck and A. Borodin, Fast modular transforms via division, 13th Annual Symposium on Switching and Automata Theory (swat 1972), pp.90-96, 1972.
DOI : 10.1109/SWAT.1972.5

C. Percival, Rapid multiplication modulo the sum and difference of highly composite numbers, Mathematics of Computation, vol.72, issue.241, pp.387-395, 2003.
DOI : 10.1090/S0025-5718-02-01419-9

A. Schönhage and . Schnelle-berechnung-von-kettenbruchentwicklungen, Schnelle Berechnung von Kettenbruchentwicklungen, Acta Informatica, vol.1, issue.2, pp.139-144, 1971.
DOI : 10.1007/BF00289520

A. Steel and V. Magma, 12-1 is up to 2.3 times faster than GMP 4.1.4 for large integer multiplication, 2005.

A. Steel, Reduce everything to multiplication Computing by the Numbers: Algorithms, Precision, and Complexity, Workshop for Richard Brent's 60th birthday, 2006.

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. Zur-gathen, G. , and J. , Modern Computer Algebra, 1999.
DOI : 10.1017/CBO9781139856065

G. Woltman and S. Kurowski, The Great Internet Mersenne Prime Search

P. Zimmermann and B. Dodson, 20 Years of ECM, Proceedings of the 7th Algorithmic Number Theory Symposium (ANTS VII), pp.525-542, 2006.
DOI : 10.1007/11792086_37
URL : https://hal.archives-ouvertes.fr/inria-00070192