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.