Bibliography

  • [Sch71]
    Article

    Schnelle Berechnung von Kettenbruchentwicklungen

    Arnold Schönhage

    Acta InformaticaVol. 1pp. 139–1441971
  • [AHU74]
    Book

    The Design and Analysis of Computer Algorithms

    A.V. Aho, J.E. Hopcroft, J.D. Ullman

    Addison-Wesley1974
  • [Bre80]
    Article

    An improved Monte Carlo factorization algorithm

    R. P. Brent

    BITVol. 20pp. 176–1841980
  • [MZ91]
    Article

    A new class of random number generators

    G. Marsaglia, A. Zaman

    Ann. Appl. Probab.Vol. 1(3)pp. 462–4801991
  • [BtR92]
    Tech Report

    Factorizations of $a^n 1$, $13 łe a < 100$

    R. P. Brent, H. J. J te Riele

    Centrum voor Wiskunde en InformaticaVol. NM-R92121992

    URL:ftp://nimbus.anu.edu.au/pub/Brent

  • [Mar92]
    Book Chapter

    The mathematics of random number generators

    G. Marsaglia

    In The unreasonable effectiveness of number theory (Orono, ME, 1991)Vol. 46pp. 73–901992
  • [Mon92]
    PhD Thesis

    An FFT Extension of the Elliptic Curve Method of Factorization

    Peter Lawrence Montgomery

    University of California, Los Angeles1992
  • [AM93]
    Article

    Elliptic curves and primality proving

    A. O. L. Atkin, F. Morain

    Math. Comp.Vol. 61pp. 29–681993
  • [LD95]
    Conference

    NFS with four large primes: An explosive experiment

    Arjen K. Lenstra, Bruce Dodson

    In Advances in cryptology---CRYPTO 1995Vol. 963pp. 372–3851995
  • [Mar95]
    Preprint

    DIEHARD: a battery of tests of randomness

    G. Marsaglia

    1995

    http://stat.fsu.edu/pub/diehard/

  • [Web95]
    Article

    The Accelerated Integer GCD Algorithm

    Kenneth Weber

    ACM Transactions on Mathematical SoftwareVol. 21(1)pp. 111–1221995
  • [Knu97]
    Book

    The Art of Computer Programming

    Donald E. Knuth

    Addison WesleyVol. 21997
  • [Mur99]
    PhD Thesis

    Polynomial selection for the number field sieve integer factorisation algorithm

    Brian Murphy

    Oxford University1999

    http://web.comlab.ox.ac.uk/oucl/work/richard.brent/ftp/Murphy-thesis.ps.gz

  • [vzGG99]
    Book

    Modern Computer Algebra

    Joachim von zur Gathen, Jürgen Gerhard

    Cambridge University Press1999
  • [Mar00]
    Preprint

    The Monster, a random number generator with period over $10^2857$ times as long as the previously touted longest-period one

    G. Marsaglia

    2000

    Preprint

  • [FKMW04]
    Book Chapter

    Proving the primality of very large numbers with fastECPP

    J. Franke, T. Kleinjung, F. Morain, T. Wirth

    In Algorithmic number theoryVol. 3076pp. 194–2072004
  • [SW17]
    Article

    Strong Pseudoprimes to Twelve Prime Bases

    DOI

    Jonathan Sorenson, Jonathan Webster

    Mathematics of ComputationVol. 86(304)pp. 985–10032017