A Computational Approach to Factoring Large Integers
General Mathematics
2009-10-29 v2
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.
Cite
@article{arxiv.0910.3012,
title = {A Computational Approach to Factoring Large Integers},
author = {Nelson Petulante},
journal= {arXiv preprint arXiv:0910.3012},
year = {2009}
}
Comments
4 pages, no figures