Hi all,

yesterday I found the following article:

https://arxiv.org/ftp/arxiv/papers/1308/1308.2891.pdf
It claims to present the fastest deterministic integer factoring algorithm, having complexity

O(N^1/6+ε).
Like Schnorr, the author is relying on lattice reduction methods.