Gaussian Difference Dynamics: Breaking the Barrier for the Shortest Vector Problem and Discrete Gaussian SamplingResearch Paper
A lattice is the set of integer combinations of the columns of a nonsingular matrix . The shortest vector problem (SVP) asks for a nonzero vector of of minimal Euclidean length . Exact SVP is the computational core of lattice basis reduction, and its running time calibrates the security estimates of lattice-based…