Four Integer Factorization Algorithms
N. A. Carella · arXiv (Cornell University) · 2010
The theoretical aspects of four integer factorization algorithms are discussed in details in this note. The focus is on the performances of these algorithms on the subset of hard to factor balanced integers N = pq, p 0 constant.