Faster SVP in Polynomial Space

Yansong Feng, Yiming Gao, Jiaqi Liu

Kannan's algorithm, as analyzed by Hanrot and Stehlé in 2007, solves the exact Euclidean shortest vector problem in polynomial space and $n^{\frac{n}{2e}+o(n)}$ time. In the classi…