arXiv · 1501.03078
Digit Polynomials and their application to integer factorization
Abstract
This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is a special case of our method. We will also consider a possibility to improve upon the complexity bound.
Explore related subjects
Keep this discovery
Markus Hittmeir. 2015-01-13. Digit Polynomials and their application to integer factorization. https://arxiv.org/abs/1501.03078
Cite the original work for its findings. Save a collection to share your selection of sources.