Paper 2021/232 Fast Factoring Integers by SVP Algorithms Claus Peter Schnorr Abstract To factor an integer $N$ we construct $n$ triples of $p_n$-smooth integers $u,v,|u-vN|$ for the $n$-th prime $p_n$. Denote such triple a fac-relation. We get fac-relations from a nearly shortest vector of the lattice $\mathcal{L}(\mathbf{R}_{n,f})$ with basis matrix $\mathbf{R}_{n,f} \in \mathbb{R}^{(n+1)\times (
![Fast Factoring Integers by SVP Algorithms](https://cdn-ak-scissors.b.st-hatena.com/image/square/6c95583c58b10f74661d0e683536751b5a5702b0/height=288;version=1;width=512/https%3A%2F%2Feprint.iacr.org%2Fimg%2Fiacrlogo.png)