An FFT extension of the elliptic curve method of factorization
An FFT extension of the elliptic curve method of factorization
Discrete weighted transforms and large-integer arithmetic
Mathematics of Computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
| Hi-index | 0.00 |
Some implementations of stage 2 of the P-1 method of factorizationuse convolutions. We describe a space-efficient implementation,allowing convolution lengths around 223 and stage 2 limit around1016 while attempting to factor 230-digit numbers on modern PC's. Wedescribe arithmetic algorithms on reciprocal polynomials. We present adjustmentsfor the P+1 algorithm. We list some new findings.