A new integer deterministic factorization algorithm, rated at arithmetic operations to O(N1/6+ε) arithmetic operations, is presented in this note. Equivalently, given the least (logN)/6 bits of a factor of the balanced integer N=pq
Nearby in the stack
, where
p
and
q
are primes, the algorithm factors the integer in polynomial time
O(log(N)c)
, with
c≥0
constant, and
ε>0
an arbitrarily small number. It improves the current deterministic factorization algorithm, rated at arithmetic operations to