In 1996, we used the self initializing quadratic sieve (siqs) to set the general purpose integer factorization record for the Cunningham project. Here, we show that this algorithm is about twice as fast as the ordinary multiple polynomial quadratic sieve (mpqs). We give running times of both algorithms for 60, 70, and 80 digit numbers. These tables show the best timings we were able to get using various parameters for each of algorithms. In all cases, the best siqs times are about twice as fast as the best mpqs times. We also explain a way of distributing the block Lanczos algorithm to solve the matrix part of the quadratic sieve. Our method was tested on an IBM SP2 parallel computer. Date Acknowledgements Many of the computers used for our 116 digit factorization came from Andrew Granville's Presidential Faculty Fellows grant. Also, Red Alford, David Benson, and Carl Pomerance have generously allowed us to use their computers. Acknowledgements are also due to our system administrators, Shaheed Bacchus and Ron Rouhani, who were very helpful and also tolerant of the factoring programs. We also thank UCNS at UGA for allowing us to use their IBM SP2, and especially Alan Ferrenberg for helping us get started on the SP2.ance were especially helpful in making the thesis more readable. I have greatly beneetted from working with Arjen Lenstra at Bellcore. Arjen has also put a lot of time into helping me with my present research. His comments and criticisms have helped me strengthen the results. I am most grateful to my advisor, Carl Pomerance. Carl has spent an enormous amount of time in helping me understand the algorithms in this thesis, as well as many other mathematical problems. Working with him has greatly improved my organization, mathematical abilities, and research skills. It amazes me that a person can spend so much time with his students and still have time to do his own research. I cannot forget the University of Georgia Mathematics Department, which has given me an excellent education. Many of the professors here are among the best teachers I have ever had. The amount of time they have spent preparing for their iii iv classes and helping students is very much appreciated. I thank Red Alford, Carl Pomerance, and Robert Rumely for helping get accepted to the University and the Department. Finally, I thank my parents, who have always encouraged me to …
[1]
Arjen K. Lenstra,et al.
The Magic Words are Squeamish Ossifrage
,
1994,
ASIACRYPT.
[2]
G. G. Stokes.
"J."
,
1890,
The New Yale Book of Quotations.
[3]
D. Coppersmith.
Solving linear equations over GF(2): block Lanczos algorithm
,
1993
.
[4]
Arjen K. Lenstra,et al.
Factoring by Electronic Mail
,
1990,
EUROCRYPT.
[5]
Robert D. Silverman.
The multiple polynomial quadratic sieve
,
1987
.
[6]
Shirley Dex,et al.
JR 旅客販売総合システム(マルス)における運用及び管理について
,
1991
.
[7]
P. Erdös,et al.
On a problem of Oppenheim concerning “factorisatio numerorum”
,
1983
.
[8]
Andrew M. Odlyzko,et al.
Solving Large Sparse Linear Systems over Finite Fields
,
1990,
CRYPTO.
[9]
Peter L. Montgomery,et al.
A Block Lanczos Algorithm for Finding Dependencies Over GF(2)
,
1995,
EUROCRYPT.
[10]
James L. Massey,et al.
Shift-register synthesis and BCH decoding
,
1969,
IEEE Trans. Inf. Theory.
[11]
Arjen K. Lenstra,et al.
A World Wide Number Field Sieve Factoring Record: On to 512 Bits
,
1996,
ASIACRYPT.
[12]
James A. Davis,et al.
Factorization Using the Quadratic Sieve Algorithm
,
1983,
CRYPTO.
[13]
J. L. Selfridge,et al.
Factorizations of b[n]±1, b=2, 3, 5, 6, 7, 10, 11, 12 up to high powers
,
1985
.
[14]
Adi Shamir,et al.
A method for obtaining digital signatures and public-key cryptosystems
,
1978,
CACM.
[15]
Arjen K. Lenstra.
Massively Parallel Computing and Factoring
,
1992,
LATIN.
[16]
Jeffrey W. Smith,et al.
A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
,
1988,
SIAM J. Comput..
[17]
Douglas H. Wiedemann.
Solving sparse linear equations over finite fields
,
1986,
IEEE Trans. Inf. Theory.
[18]
Arjen K. Lenstra,et al.
NFS with Four Large Primes: An Explosive Experiment
,
1995,
CRYPTO.
[19]
D. Coppersmith.
Solving homogeneous linear equations over GF (2) via block Wiedemann algorithm
,
1994
.
[20]
Carl Pomerance,et al.
The Quadratic Sieve Factoring Algorithm
,
1985,
EUROCRYPT.
[21]
Arjen K. Lenstra,et al.
Factoring With Two Large Primes
,
1990,
EUROCRYPT.