CSDL Home F FOCS 2011 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS 2011)

Subscribe

Palm Springs, CA

Oct. 22, 2011 to Oct. 25, 2011

ISBN: 978-1-4577-1843-4

pp: 580-589

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2011.31

ABSTRACT

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 the M-ellipsoid, and uses as a crucial subroutine the recent algorithm of Micciancio and Voulgaris (STOC 2010)for lattice problems in the l2 norm. As a main technical contribution, which may be of independent interest, we build on the techniques of Klartag (Geometric and Functional Analysis, 2006) to give an expected 2^O(n)-time algorithm for computing an M-ellipsoid for any n-dimensional convex body. As applications, we give deterministic 2^O(n)-time and -space algorithms for solving exact SVP, and exact CVP when the target point is sufficiently close to the lattice, on n-dimensional lattices in any (semi-)norm given an M-ellipsoid of the unit ball. In many norms of interest, including all lp norms, an M-ellipsoid is computable in deterministic poly(n) time, in which case these algorithms are fully deterministic. Here our approach may be seen as a derandomization of the â??AKS sieveâ?for exact SVP and CVP (Ajtai, Kumar, and Siva Kumar, STOC2001 and CCC 2002). As a further application of our SVP algorithm, we derive an expected O(f*(n))^n-time algorithm for Integer Programming, where f*(n) denotes the optimal bound in the so-called â??flatnesstheorem, â? which satisfies f*(n) = O(n^(4/3) polylog(n))and is conjectured to be f*(n) = O(n). Our runtime improves upon the previous best of O(n^2)^n by Hildebrand and Koppe(2010).

INDEX TERMS

Shortest/Closest Vector Problem, Integer Programming, Lattice Point Enumeration, M-ellipsoid

CITATION

Daniel Dadush,
Chris Peikert,
Santosh Vempala,
"Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings",

*FOCS*, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS 2011), 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS 2011) 2011, pp. 580-589, doi:10.1109/FOCS.2011.31