Bibliography
- AHU74
-
A.V. Aho, J.E. Hopcroft, and J.D. Ullman.
The Design and Analysis of Computer Algorithms.
Addison-Wesley, Reading, MA, 1974.
- AM93
-
A. O. L. Atkin and F. Morain.
Elliptic curves and primality proving.
Math. Comp., 61:29 -- 68, 1993.
- Bre80
-
R. P. Brent.
An improved Monte Carlo factorization algorithm.
BIT, 20:176--184, 1980.
- BtR92
-
R. P. Brent and H. J. J te Riele.
Factorizations of an ∓ 1, 13 ≤a < 100.
Technical report, Centrum voor Wiskunde en Informatica, Amsterdam, 1992.
ftp://nimbus.anu.edu.au/pub/Brent.
- Jae93
-
G. Jaeschke.
On strong pseudoprimes to several bases.
Math. Comp., 61:915 -- 926, 1993.
- Knu97
-
Donald E. Knuth.
The Art of Computer Programming, volume 2.
Addison Wesley, Reading, Massachusetts, 3rd edition, 1997.
- LD95
-
Arjen K. Lenstra and Bruce Dodson.
NFS with four large primes: An explosive experiment.
In Don Coppersmith, editor, Advances in cryptology---CRYPTO 1995, volume 963 of LNCS, pages 372--385, Berlin, 1995. Springer.
- Mar92
-
George Marsaglia.
The mathematics of random number generators.
In The unreasonable effectiveness of number theory (Orono, ME, 1991), volume 46 of Proc. Sympos. Appl. Math., pages 73--90.
Amer. Math. Soc., Providence, RI, 1992.
- Mar95
-
G. Marsaglia.
DIEHARD: a battery of tests of randomness.
http://stat.fsu.edu/pub/diehard/, 1995.
- Mar00
-
G. Marsaglia.
The Monster, a random number generator with period over 102857 times as long as the previously touted longest-period one.
Preprint, 2000.
- Mon92
-
Peter Lawrence Montgomery.
An FFT Extension of the Elliptic Curve Method of Factorization.
PhD thesis, University of California, Los Angeles, 1992.
- Mur99
-
Brian Murphy.
Polynomial selection for the number field sieve integer factorisation algorithm.
PhD thesis, Oxford University, 1999.
http://web.comlab.ox.ac.uk/oucl/work/richard.brent/ftp/Murphy-thesis.ps.gz.
- MZ91
-
George Marsaglia and Arif Zaman.
A new class of random number generators.
Ann. Appl. Probab., 1(3):462--480, 1991.
- Sch71
-
Arnold Schönhage.
Schnelle Berechnung von Kettenbruchentwicklungen.
Acta Informatica, 1:139--144, 1971.
- vzGG99
-
Joachim von zur Gathen and Jürgen Gerhard.
Modern Computer Algebra.
Cambridge University Press, Cambridge, 1999.
- Web95
-
Kenneth Weber.
The Accelerated Integer GCD Algorithm.
ACM Transactions on Mathematical Software, 21(1):111--122, 1995.
V2.28, 13 July 2023