Factoring on a Computer

[1]  J. L. Selfridge,et al.  Factorizations of b[n]±1, b=2, 3, 5, 6, 7, 10, 11, 12 up to high powers , 1985 .

[2]  Marvin C. Wunderlich,et al.  Implementing the continued fraction factoring algorithm on parallel machines , 1985 .

[3]  J. Dixon.  Factorization and Primality Tests , 1984 .

[4]  Gustavus J. Simmons,et al.  Secure Communications And Asymmetric Cryptosystems , 1984 .

[5]  H. Lenstra,et al.  Primalitv Testing and Jacobi Sums , 2010 .

[6]  J. Gerver.  Factoring large numbers with a quadratic sieve , 1983 .

[7]  Marvin C. Wunderlich,et al.  Recent Advances in the design and implementation of Large Integer Factorization Algorithms , 1983, 1983 IEEE Symposium on Security and Privacy.

[8]  L. Adleman,et al.  On distinguishing prime numbers from composite numbers , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[9]  H. C. Williams,et al.  A $p+1$ method of factoring , 1982 .

[10]  C. Pomerance.  Recent developments in primality testing , 1981 .

[11]  R. Brent,et al.  Factorization of the eighth Fermat number , 1981 .

[12]  Robert P. Backstrom.  Table errata: “A method of factoring and the factorization of ₇” [Math. Comp. 29 (1975), 183–205; MR 51 #8017] by M. A. Morrison and J. Brillhart , 1980 .

[13]  J. Pollard.  A monte carlo method for factorization , 1975 .

[14]  J. Brillhart,et al.  A method of factoring and the factorization of , 1975 .

[15]  J. M. Pollard,et al.  Theorems on factorization and primality testing , 1974, Mathematical Proceedings of the Cambridge Philosophical Society.

[16]  Marvin C. Wunderlich,et al.  A design for a number theory package with an optimized trial division routine , 1974, CACM.

[17]  Donald Ervin Knuth,et al.  The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[18]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[19]  A. H. Beiler,et al.  Recreations in the theory of numbers : the queen of mathematics entertains , 1965 .