Jonathan M. Borwein and Peter B. Borwein, “Pi and the AGM: A Study in
Analytic Number Theory and Computational Complexity”, Wiley, 1998.
Richard Crandall and Carl Pomerance, “Prime Numbers: A Computational
Perspective”, 2nd edition, Springer-Verlag, 2005.
http://www.math.dartmouth.edu/~carlp/
Henri Cohen, “A Course in Computational Algebraic Number Theory”, Graduate
Texts in Mathematics number 138, Springer-Verlag, 1993.
http://www.math.u-bordeaux.fr/~cohen/
Yves Bertot, Nicolas Magaud and Paul Zimmermann, “A Proof of GMP Square
Root”, Journal of Automated Reasoning, volume 29, 2002, pp. 225-252. Also
available online as INRIA Research Report 4475, June 2002,
http://hal.inria.fr/docs/00/07/21/13/PDF/RR-4475.pdf
Torbjörn Granlund and Peter L. Montgomery, “Division by Invariant Integers
using Multiplication”, in Proceedings of the SIGPLAN PLDI'94 Conference, June
1994. Also available https://gmplib.org/~tege/divcnst-pldi94.pdf.
Tudor Jebelean, “A Double-Digit Lehmer-Euclid Algorithm for Finding the GCD
of Long Integers”, Journal of Symbolic Computation, volume 19, 1995,
pp. 145-157. Technical report version also available
ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1992/92-69.ps.gz
Makoto Matsumoto and Takuji Nishimura, “Mersenne Twister: A 623-dimensionally
equidistributed uniform pseudorandom number generator”, ACM Transactions on
Modelling and Computer Simulation, volume 8, January 1998, pp. 3-30.
Available online
http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/ARTICLES/mt.ps.gz (or .pdf)
R. Moenck and A. Borodin, “Fast Modular Transforms via Division”,
Proceedings of the 13th Annual IEEE Symposium on Switching and Automata
Theory, October 1972, pp. 90-96. Reprinted as “Fast Modular Transforms”,
Journal of Computer and System Sciences, volume 8, number 3, June 1974,
pp. 366-386.
Niels Möller, “On Schönhage's algorithm and subquadratic integer GCD
computation”, in Mathematics of Computation, volume 77, January 2008, pp.
589-607.
Peter L. Montgomery, “Modular Multiplication Without Trial Division”, in
Mathematics of Computation, volume 44, number 170, April 1985.
Arnold Schönhage and Volker Strassen, “Schnelle Multiplikation grosser
Zahlen”, Computing 7, 1971, pp. 281-292.
Kenneth Weber, “The accelerated integer GCD algorithm”,
ACM Transactions on Mathematical Software,
volume 21, number 1, March 1995, pp. 111-122.
Dan Zuras, “On Squaring and Multiplying Large Integers”, ARITH-11: IEEE
Symposium on Computer Arithmetic, 1993, pp. 260 to 271. Reprinted as “More
on Multiplying and Squaring Large Integers”, IEEE Transactions on Computers,
volume 43, number 8, August 1994, pp. 899-908.