< BACK TO NEWS
importantSYS.SOURCE: arXiv2026-08-05T02:07:06Z

Efficient Algorithm for the Shortest Vector Problem Using Mid-Point Hessian

This paper presents an improved algorithm for solving the Shortest Vector Problem (SVP) in n-dimensional lattices, achieving a classical time complexity of 2^{0.6039n+o(n)} and a quantum time complexity of 2^{0.5411n+o(n)}. The approach leverages properties of the Hessian of a periodic Gaussian function at half the shortest vector, combined with discrete Gaussian sampling and sublattice coset optimizations.

Comments

Read original article

*** END OF TRANSMISSION ***