Note on Integer Factoring Algorithms II

arXivmath/0702227MaRDI QIDQ6478745FDOQ6478745

Publication date: 8 February 2007

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.

Mathematics Subject Classification ID

Quadratic and bilinear Diophantine equations (11D09) Factorization (11Y05)

This page was built for publication: Note on Integer Factoring Algorithms II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6478745)