this paper, the authors comment about one particularly fast way of initializing, but suppress most of the details. This was later published in [1], and is known as the self initializing quadratic sieve (siqs).
|
2096
|
A method for obtaining digital signatures and public-key cryptosystems
– Rivest, Shamir, et al.
- 1978
|
|
181
|
Shift-register synthesis and BCH decoding
– Massey
- 1969
|
|
109
|
Solving sparse linear equations over finite fields
– Wiedemann
- 1997
|
|
92
|
eds.), The development of the number field sieve
– Lenstra, Lenstra
- 1993
|
|
70
|
The multiple polynomial quadratic sieve
– Silverman
- 1987
|
|
65
|
Discrete logarithms in finite fields and their cryptographic significance
– ODLYZKO
- 1985
|
|
46
|
Solving Large Sparse Linear Systems over Finite Fields
– LaMacchia, Odlyzko
- 1991
|
|
46
|
Factoring by electronic mail
– LENSTRA, MANASSE
|
|
44
|
Solving homogeneous linear equations over GF (2) via block Wiedemann algorithm
– Coppersmith
- 1994
|
|
44
|
Analysis and comparison of some integer factoring algorithms
– POMERANCE
|
|
43
|
The quadratic sieve factoring algorithm
– Pomerance
- 1984
|
|
41
|
A block Lanczos algorithm for finding dependencies over GF(2),Advances in Cryptology - EUROCRYPT'95
– Montgomery
- 1995
|
|
40
|
On a Problem of Oppenheim Concerning ‘Factorisatio Numerorum
– Canfield, Erdös, et al.
- 1983
|
|
39
|
Factoring with two large primes
– Lenstra, Manasse
- 1994
|
|
33
|
A pipeline architecture for factoring large integers with the quadratic sieve algorithm
– Pomerance, Smith, et al.
- 1988
|
|
31
|
The magic words are squeamish ossifrage
– Atkins, Graff, et al.
- 1995
|
|
22
|
A world wide number field sieve factoring record: on to 512 bits
– Cowie, Dodson, et al.
- 1996
|
|
22
|
NFS with four large primes: an explosive experiment, in preparation
– Dodson, Lenstra
|
|
21
|
Factorizations of b n \Sigma 1, b
– Brillhart, Lehmer, et al.
- 1988
|
|
20
|
Solving linear equations over GF (2): Block Lanczos algorithm
– Coppersmith
- 1993
|
|
13
|
Implementing the self-initializing quadratic sieve on a distributed network
– Alford, Pomerance
|
|
10
|
Factorization using the quadratic sieve algorithm
– Davis, Holdridge
- 1983
|
|
8
|
The number field sieve
– Pomerance
- 1994
|
|
6
|
Massively parallel computing and factoring
– Lenstra
- 1992
|
|
4
|
Lenstra, Implementations of blocked Lanczos and Wiedemann algorithms, manuscript
– Contini, Lenstra
|
|
2
|
Reduction of large, sparse matrices over a finite field via created catastrophes, manuscript in preparation
– Pomerance, Smith
- 1992
|