Faster deterministic integer factorization

2012/01/10 by Costa, Edgar, Harvey, David
#11Y05 #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1201.2116

Abstract

The best known unconditional deterministic complexity bound for computing the prime factorization of an integer N is O(M_int(N^(1/4) log N)), where M_int(k) denotes the cost of multiplying k-bit integers. This result is due to Bostan--Gaudry--Schost, following the Pollard--Strassen approach. We show that this bound can be improved by a factor of (log log N)^(1/2).

Related

• Deterministic Integer Factorization Algorithms
• Note Integer Factoring Methods III
• An exponent one-fifth algorithm for deterministic integer factorisation
• Note on Integer Factoring Methods IV
• Four Integer Factorization Algorithms