Digit Polynomials and their application to integer factorization

2015/01/13 by Markus Hittmeir, Hittmeir, Markus
Computer Science · #Coding theory and cryptography #Cryptography and Residue Arithmetic #FOS: Mathematics #Number Theory (math.NT) #Polynomial and algebraic computation

paper · pdf · doi:10.48550/arxiv.1501.03078

openalex publication_date 2015/01/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity O(N^1/4+ε). 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.

Related

• Note on Integer Factoring Methods IV
• Deterministic Integer Factorization Algorithms
• Four Integer Factorization Algorithms
• A deterministic algorithm for integer factorization
• Note Integer Factoring Methods III