Factoring using multiplicative relations modulo $n$: a subexponential algorithm inspired by the index calculus. (arXiv:2211.06821v1 [math.NT])

We demonstrate that a modification of the classical index calculus algorithm
can be used to factor integers. More generally, we reduce the factoring problem
to finding an overdetermined system of multiplicative relations in any factor
base modulo $n$, where $n$ is the integer whose factorization is sought. The
algorithm has subexponential runtime $\exp(O(\sqrt{\log n \log \log n}))$ (or
$\exp(O( (\log n)^{1/3} (\log \log n)^{2/3} ))$ with the addition of a number
field sieve), but requires a rational linear algebra phase, …

algorithm factoring math