Superlattice methods for the shortest vector problem and discrete Gaussian samplingResearch Paper
The shortest vector problem (SVP) asks, given a basis of a lattice , for a nonzero lattice vector of minimum length . Lattice-based cryptography, which includes the post-quantum standards ML-KEM and ML-DSA, sets its parameters by the cost of the best SVP algorithms. Lattice sieves, run inside block reduction, are the attacks…