The quadratic sieve factoring algorithm
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Discrete logarithms in finite fields and their cryptographic significance
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
An implementation of the general number field sieve
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On the factorization of RSA-120
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Factoring with two large primes
Mathematics of Computation
Solving Large Sparse Linear Systems over Finite Fields
CRYPTO '90 Proceedings of the 10th 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
Lattice sieving and trial division
ANTS-I Proceedings of the First 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
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Some Parallel Algorithms for Integer Factorisation
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Computation of Discrete Logarithms in F2607
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Running time predictions for factoring algorithms
ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
| Hi-index | 0.00 |
The purpose of this paper is to report the unexpected results that we obtained while experimenting with the multi-large prime variation of the general number field sieve integer factoring algorithm (NFS, cf. [8]). For traditional factoring algorithms that make use of at most two large primes, the completion time can quite accurately be predicted by extrapolating an almost quartic and entirely 'smooth' function that counts the number of useful combinations among the large primes [1]. For NFS such extrapolations seem to be impossible--the number of useful combinations suddenly 'explodes' in an as yet unpredictable way, that we have not yet been able to understand completely. The consequence of this explosion is that NFS is substantially faster than expected, which implies that factoring is somewhat easier than we thought.