Multiplication method for factoring natural numbers

2019/03/29 by Nesiolovskiy, Igor, Nesiolovskiy, Artem
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1903.12449

Abstract

We offer multiplication method for factoring big natural numbers which extends the group of the Fermat's and Lehman's factorization algorithms and has run-time complexity O(n^1/3). This paper is argued the finiteness of proposed algorithm depending on the value of the factorizable number n. We provide here comparative tests results of related algorithms on a large amount of computational checks. We describe identified advantages of the proposed algorithm over others. The possibilities of algorithm optimization for reducing the complexity of factorization are also shown here.

Related

• The new Fermat-type factorization algorithm
• Note on Integer Factoring Algorithms II
• Note Integer Factoring Methods III
• A Computational Approach to Factoring Large Integers
• A deterministic algorithm for integer factorization