Factoring integers with large-prime variations of the quadratic sieve

Experimental Mathematics

Volumn 5, Issue 4, 1996, Pages 257-273

  Boender, Henk ^a,b   Te Riele, Herman J J ^b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b CWI   (Netherlands)

Author keywords

Cluster of workstations; Factorization; Multiple polynomial quadratic sieve; Vector supercomputer

Indexed keywords

EID: 85023960883     PISSN: 10586458     EISSN: 1944950X     Source Type: Journal    
DOI: 10.1080/10586458.1996.10504592     Document Type: Article

References (27)

1. W. R. Alford and C. Pomerance, "Implementing the self-initializing quadratic sieve on a distributed network", pp. 163-174 in Number-theoretic and algebraic methods in computer science (NTAMCS '93: Moscow, 1993), edited by A. J. van der Poorten et al., World Scientific, River Edge, NJ, 1995.
2. D. Atkins, M. Graff, A. K. Lenstra, and P. C. Leyland, "The magic words are squeamish ossifrage", pp. 263-277 in Advances in cryptology (ASIACRYPT '94: Wollongong, 1994), edited by J. Pieprzyk and R. Safavi-Naini, Lecture Notes in Comp. Sci. 917, Springer, Berlin, 1995.
3. B. Bollobás, Random graphs, Academic Press, London and Orlando, FL, 1985.
4. n ± 1, 13 ≤ a < 100", Technical Report NM-R9212, Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands, June 1992. Updates to this report have appeared as CWI Report NMR9419, September 1994 and CWI Report NMR9609, March 1996, with P. L. Montgomery as a coauthor. The complete tables, incorporating these updates, are available at ftp://nimbus.anu.edu.au/pub/Brent/factorsorftp://ftp.cwi.nl/pub/herman/factors.
5. D. M. Bressoud, Factorization and primality testing, Undergraduate Texts in Math., Springer, New York, 1989.
6. J. A. Davis and D. B. Holdridge, "Factorization using the quadratic sieve algorithm", Technical Report Sand 83-1346, Sandia National Laboratories, Albuquerque, NM, 1983.
7. T. F. Denny, "Faktorisieren mit dem quadratischen Sieb", Master's thesis, Universität des Saarlandes, Saarbrücken, 1993.
8. T. F. Denny, B. Dodson, A. K. Lenstra, and M. S. Manasse, "On the factorization of RSA-120", pp. 166-174 in Advances in Cryptology (CRYPTO '93: Santa Barbara, CA, 1993), edited by D. R. Stinson, Lecture Notes in Comp. Sci. 773, Springer, Berlin, 1994.
9. P. Erdos and A. Renyi, "On random graphs I", Publ. Math. Debrecen 6 (1959), 290-297.
10. P. Erdős and A. Renyi, "On the evolution of random graphs", Publ. Math. Inst. Hungar. Acad. Sci. 5 (1960), 17-61.
11. P. Erdős and A. Renyi, "On the evolution of random graphs", Bull. Inst. Int. Statist. Tokyo 38 (1961), 343-347.
12. M. Kraitchik, Recherches sur la theorie des nombres, II, Gauthier-Villars, Paris, 1929.
13. D. H. Lehmer and R. E. Powers, "On factoring large numbers", Bull. Amer. Math. Soc. 37 (1931), 770-776.
14. A. K. Lenstra and H. W. Lenstra Jr. (editors), The development of the number field sieve, Lecture Notes in Math. 1554, Springer, Berlin, 1993.
15. A. K. Lenstra and M. S. Manasse, "Factoring with two large primes", Math. Comp. 63 (1994), 785-798.
16. M. A. Morrison and J. Brillhart, "A method of factoring and the factorization of F7", Math. Comp. 29 (1975), 183-205.
17. D. Parkinson and W. Wunderlich, "A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers", Parallel Comput. 1 (1984), 65-73.
18. K. Paton, "An algorithm for finding a fundamental set of cycles of a graph", Comm. ACM 12 (1969), 514-518.
19. R. Peralta, "Implementation of the hypercube variation of the multiple polynomial quadratic sieve". To appear.
20. C. Pomerance, "Analysis and comparison of some integer factoring algorithms", pp. 89-139 in Computational methods in number theory, I, edited by H. W. Lenstra, Jr. and R. Tijdeman, Mathematisch Centrum, Amsterdam, 1982.
21. C. Pomerance, "The quadratic sieve factoring algorithm", pp. 169-182 in Advances in cryptology (EUROCRYPT '84: Paris, 1984), edited by T. Beth et al., Lecture Notes in Comp. Sci. 209, Springer-Verlag, New York, 1985.
22. C. Pomerance, J. W. Smith, and R. Tuler, "A pipeline architecture for factoring large integers with the quadratic sieve algorithm", SIAM J. Comput. 17 (1988), 387-403.
23. H. J. J. te Riele, W. M. Lioen, and D. T. Winter, "Factoring with the quadratic sieve on large vector computers", J. Comp. Appl. Math. 27 (1989), 267-278.
24. H. te Riele, W. Lioen, and D. Winter, "Factorization beyond the googol with MPQS on a single computer", CWI Quarterly 4 (March 1991), 69-72.
25. H. Riesel, Prime numbers and computer methods for factorization, Progress in Math. 126, Birkhsuser, Boston, 1985.
26. R. D. Silverman, "The multiple polynomial quadratic sieve", Math. Oomp. 48 (1987), 329-339.
27. S. S. Wagstaff Jr., December 13, 1993. Regular letter to subscribers describing the state of the Cunningham factorization project.