Multiplication method for factoring natural numbers

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\mathrm{/}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.