Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
We give a novel algorithm for enumerating lattice points in any convex body, and give applications to several classic lattice problems, including the Shortest and Closest Vector Problems (SVP and CVP, respectively) and Integer Programming (IP). Our enumeration technique relies on a classical concept from asymptotic convex geometry known as …