Faster deterministic integer factorization
Number Theory
2012-01-11 v1 Data Structures and Algorithms
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).
Keywords
Cite
@article{arxiv.1201.2116,
title = {Faster deterministic integer factorization},
author = {Edgar Costa and David Harvey},
journal= {arXiv preprint arXiv:1201.2116},
year = {2012}
}
Comments
7 pages