Symbolic Arithmetic and Integer Factorization
Samuel J. Lomonaco

TL;DR
This paper introduces a novel algebraic approach to integer factorization by transforming it into Boolean equation solving, leading to new algorithms that could inspire future improvements or quantum methods.
Contribution
It develops a systematic procedure to convert integer factorization into Boolean equations and proposes two new factoring algorithms based on this algebraic structure.
Findings
Introduces Boolean factoring (BF) algorithm
Proposes multiplicative Boolean factoring (MBF) algorithm
Algorithms are not yet competitive but offer new research directions
Abstract
In this paper, we create a systematic and automatic procedure for transforming the integer factorization problem into the problem of solving a system of Boolean equations. Surprisingly, the resulting system of Boolean equations takes on a "life of its own" and becomes a new type of integer, which we call a generic integer. We then proceed to use the newly found algebraic structure of the ring of generic integers to create two new integer factoring algorithms, called respectively the Boolean factoring (BF) algorithm, and the multiplicative Boolean factoring (MBF) algorithm. Although these two algorithms are not competitive with current classical integer factoring algorithms, it is hoped that they will become stepping stones to creating much faster and more competitive algorithms, and perhaps be precursors of a new quantum algorithm for integer factoring.
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
TopicsQuantum Computing Algorithms and Architecture · Computability, Logic, AI Algorithms · Numerical Methods and Algorithms
