论文信息 - Improved Stage 2 to P±1 Factoring Algorithms

Improved Stage 2 to P±1 Factoring Algorithms

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.

Peter L. Montgomery | Alexander Kruppa | P. L. Montgomery | A. Kruppa

[1] P. L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization , 1987 .

[2] Daniel J. Bernstein,et al. Modular exponentiation via the explicit Chinese remainder theorem , 2007, Math. Comput..

[3] P. L. Montgomery. Modular multiplication without trial division , 1985 .

[4] P. L. Montgomery,et al. An FFT extension of the elliptic curve method of factorization , 1992 .

[5] Bruce Dodson,et al. 20 Years of ECM , 2006, ANTS.

[6] Manfred Tasche,et al. Fast Polynomial Multiplication and Convolutions Related to the Discrete Cosine Transform , 1997 .

[7] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[8] J. M. Pollard,et al. Theorems on factorization and primality testing , 1974, Mathematical Proceedings of the Cambridge Philosophical Society.

[9] Robert D. Silverman,et al. AN FFT EXTENSION TO THE P - 1 FACTORING ALGORITHM , 1990 .

[10] B. Fagin,et al. Discrete weighted transforms and large-integer arithmetic , 1994 .

[11] H. C. Williams,et al. A $p+1$ method of factoring , 1982 .

[12] H. Nussbaumer. Fast Fourier transform and convolution algorithms , 1981 .

[13] Jeffrey Shallit,et al. Algorithmic Number Theory , 1996, Lecture Notes in Computer Science.