A Computational Approach to Factoring Large Integers
arXiv:0910.3012
Abstract
To factor an integer N, given that it is equal to the product of two primes, it suffices to find an integer d satisfying a certain simple numerical test. In this approach, the factorization problem equates to the problem of designing an optimal data base of values d to be tested.
4 pages, no figures