Generalized Trial Division
Murat Sah · 2011
In this paper, we propose an algorithm of factoring any integer N . This special-purpose algorithm will factor a number N efficiently if there exist a positive integer k such that k times any prime factor of N is close to √ N . it will be improved by using nested squares polynomials. Indeed, under an assumption about nested squares polynomials, this algorithm becomes an general-purpose algorithm with sub-exponential or polynomial running time.