Bibliography
- [AHU74]Book
The Design and Analysis of Computer Algorithms.
Addison-Wesley, Reading, MA, 1974.Cited in 1 page
- [AM93]Article
Elliptic curves and primality proving.
Math. Comp., 61:29–68, 1993. - [Bre80]Article
An improved Monte Carlo factorization algorithm.
BIT, 20:176–184, 1980.Cited in 1 page
- [BtR92]Tech Report
Factorizations of $a^n \pm 1$, $13 \le a < 100$.
Report NM-R9212, Centrum voor Wiskunde en Informatica, Amsterdam, 1992.URL:ftp://nimbus.anu.edu.au/pub/Brent.
Cited in 1 page
- [FKMW04]Book Chapter
Proving the primality of very large numbers with fastECPP.
In Algorithmic number theory, volume 3076 of Lecture Notes in Comput. Sci., pages 194–207. Springer, Berlin, 2004. - [Knu97]Book
The Art of Computer Programming, volume 2.
Addison Wesley, Reading, Massachusetts, 3rd edition, 1997.Cited in 1 page
- [LD95]Conference
NFS with four large primes: An explosive experiment.
In D. Coppersmith, editor, Advances in cryptology—CRYPTO 1995, volume 963 of LNCS, pages 372–385, Berlin, 1995. Springer. - [Mar92]Book ChapterIn 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.
Cited in 1 page
- [Mar95]Preprint
DIEHARD: a battery of tests of randomness.
https://web.archive.org/web/20161114211602/http://stat.fsu.edu:80/pub/diehard/, 1995.Cited in 1 page
- [Mar00]Preprint
The Monster, a random number generator with period over $10^{2857}$ times as long as the previously touted longest-period one.
Preprint, 2000.Cited in 1 page
- [Mon92]PhD Thesis
An FFT Extension of the Elliptic Curve Method of Factorization.
PhD thesis, University of California, Los Angeles, 1992.Cited in 1 page
- [Mur99]PhD Thesis
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.
Cited in 1 page
Advanced Factorization Techniques: The Number Field Sieve (also Advanced Factorization Techniques: The Number Field Sieve, citation 2, Advanced Factorization Techniques: The Number Field Sieve, citation 3, Advanced Factorization Techniques: The Number Field Sieve, citation 4, Advanced Factorization Techniques: The Number Field Sieve, citation 5, Advanced Factorization Techniques: The Number Field Sieve, citation 6, Advanced Factorization Techniques: The Number Field Sieve, citation 7)
- [MZ91]Article
A new class of random number generators.
Ann. Appl. Probab., 1(3):462–480, 1991.Cited in 1 page
- [Sch71]Article
Schnelle Berechnung von Kettenbruchentwicklungen.
Acta Informatica, 1:139–144, 1971.Cited in 1 page
- [SW17]Article
Strong Pseudoprimes to Twelve Prime Bases.
Mathematics of Computation, 86(304):985–1003, 2017. - [vzGG99]Book
Modern Computer Algebra.
Cambridge University Press, Cambridge, 1999.Cited in 1 page
- [Web95]Article
The Accelerated Integer GCD Algorithm.
ACM Transactions on Mathematical Software, 21(1):111–122, 1995.Cited in 1 page