lattice-problems

This paper presents randomized algorithms for the Shortest Vector Problem (SVP), improving the best-known time complexity to 2^{0.6039n} classically and 2^{0.5411n} quantumly using the Hessian of the periodic Gaussian function at mid-points.