This note continues the theoretical development of deterministic integer
factorization algorithms based on systems of polynomials equations. The main
result establishes a new deterministic time complexity bench mark in integer
factorization.Comment: 20 Pages, New Versio

Carella, N. A.

English

arXiv

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

Carella, Nelson A.

DigitalCommons@Pace

Pace UniversityDigitalCommons@PaceCSIS Technical Reports Ivan G. Seidenberg School of Computer Scienceand Information Systems1-1-2007Note on Integer Factoring Methods INelson A. CarellaPace UniversityFollow this and additional works at: http://digitalcommons.pace.edu/csis_tech_reportsThis Article is brought to you for free and open access by the Ivan G. Seidenberg School of Computer Science and Information Systems atDigitalCommons@Pace. It has been accepted for inclusion in CSIS Technical Reports by an authorized administrator of DigitalCommons@Pace. Formore information, please contact rracelis@pace.edu.Recommended CitationCarella, Nelson A., "Note on Integer Factoring Methods I" (2007). CSIS Technical Reports. Paper 26.http://digitalcommons.pace.edu/csis_tech_reports/26

Note on Integer Factoring Methods IV

Abstract

Similar works

Full text

Available Versions

DigitalCommons@Pace