Article thumbnail

Algorithms for the Densest Sub-Lattice Problem

By Daniel Dadush and Daniele Micciancio

Abstract

We give algorithms for computing the densest k-dimensional sublattice of an arbitrary lattice, and related problems. This is an important problem in the algorithmic geometry of numbers that includes as special cases Rankin’s problem (which corresponds to the densest sublattice problem with respect to the Euclidean norm, and has applications to the design of lattice reduction algorithms), and the shortest vector problem for arbitrary norms (which corresponds to setting k = 1) and its dual (k = n − 1). Remarkably, our algorithm works for any norm and has running time k O(k·n). In particular, the algorithm runs in single exponential time 2 O(n) for any constant k = O(1)

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.226.2325
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www2.isye.gatech.edu/%7... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.