Note on Integer Factoring Algorithms II
Number Theory
2007-05-23 v1 General Mathematics
Abstract
This note introduces a new class of integer factoring algorithms. Two versions of this method will be described, deterministic and probabilistic. These algorithms are practical, and can factor large classes of balanced integers N = pq, p < q < 2p in superpolynomial time. Further, an extension of the Fermat factoring method is proposed.
Cite
@article{arxiv.math/0702227,
title = {Note on Integer Factoring Algorithms II},
author = {N. A. Carella},
journal= {arXiv preprint arXiv:math/0702227},
year = {2007}
}
Comments
23 Pages