We present randomized algorithms for the shortest vector problem (SVP). For the n-dimensional lattice L, our algorithms solve SVP in time $2^{0.6039n}+o(n)$ classically and $2^{0.5411n}+o(n)$ quantumly and space $2^{0.5n}+o(n)$, improving the previous best algorithm running in $2^n+o(n)$ time and space of Aggarwal, Dadush, Regev, and Stephens-Davidowitz [STOC'15].
Our algorithms heavily use the property of the Hessian of the periodic Gaussian function at the half shortest vector: For a shortest vector $v \in L$, the Hessian at $v/2$ has the eigenvector close to $v$, which can be used to recover $v$ using the (preprocessing) bounded distance decoding algorithm. Given the periodicity modulo L, the candidate midpoints are indexed by the parity classes in $L/2L$. Our algorithm searches for the class of a shortest vector by estimating the corresponding Hessians using discrete Gaussian samples.
We optimize the algorithm using random sublattice cosets and various sampling technique, achieving the final complexity. The optimization techniques may be of independent interest.
