Multiplication method for factoring natural numbers
Igor Nesiolovskiy, Artem Nesiolovskiy

TL;DR
This paper introduces a multiplication-based factoring algorithm for large natural numbers with a runtime of O(n^{1/3}), extending Fermat's and Lehman's methods, and discusses its advantages, optimization potential, and finite algorithm validity.
Contribution
It presents a novel multiplication method for factoring that extends existing algorithms and analyzes its complexity and optimization possibilities.
Findings
Algorithm has O(n^{1/3}) complexity.
Comparative tests show advantages over related algorithms.
Optimization strategies can further reduce complexity.
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 . 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Numerical Methods and Algorithms · Cryptography and Residue Arithmetic
