Dawu Gu

Dynamic Scaling Pollard’s P-1 Algorithm

The integer factorization problem is a hard problem in classical. Let N=PQ, where P and Q are large primes. Pollard’s P-1 Algorithm is an efficient integer factorization algorithm while all the prime factors of P−1 are small. However, the previous variants of Pollard’s P-1 algori...