Comments

This paper was originally published as a Technical Report No. 234, January 2007 for the Ivan E. Seidenberg School of Computer Science and Information Systems (ISSCSIS) Pace University.

Document Type

Article

Abstract

This note presents the basic mathematical structure of a new integer factorization method based on systems of linear Diophantine equations. The estimated theoretical running time complexities of the corresponding algorithms are encouraging and improve the current ones. The work is presented as a theoretical contribution to the theory of integer factorization.



Share

COinS