EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Factoring with two large primes
Mathematics of Computation
NFS with Four Large Primes: An Explosive Experiment
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
The Magic Words are Squeamish Ossifrage
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
A World Wide Number Field Sieve Factoring Record: On to 512 Bits
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Factorization of RSA-140 Using the Number Field Sieve
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Strategies in Filtering in the Number Field Sieve
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
A block Lanczos algorithm for finding dependencies over GF(2)
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Experiments on the linear algebra step in the number field sieve
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
Running time predictions for factoring algorithms
ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
| Hi-index | 0.00 |
We report the factorization of a 135-digit integer by the triple-large-prime variation of the multiple polynomial quadratic sieve. Previous workers [6][10] had suggested that using more than two large primes would be counterproductive, because of the greatly increased number of false reports from the sievers. We provide evidence that, for this number and our implementation, using three large primes is approximately 1.7 times as fast as using only two. The gain in efficiency comes from a sudden growth in the number of cycles arising from relations which contain three large primes. This effect, which more than compensates for the false reports, was not anticipated by the authors of [6][10] but has become quite familiar from factorizations obtained using the number field sieve. We characterize the various types of cycles present, and give a semi-quantitative description of their rather mysterious behaviour.