Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Limits on the Hardness of Lattice Problems in
ℓ
p
Norms
| |
|
Limits on the Hardness of Lattice Problems in ℓ
p
Norms
Chris Peikert1 
| (1) |
Computer Science Laboratory, SRI International, 333 Ravenswood Ave, Menlo Park, CA 94043, USA |
Published online: 2 May 2008
Abstract. Several recent papers have established limits on the computational difficulty of lattice problems, focusing primarily on the
ℓ
2 (Euclidean) norm. We demonstrate close analogues of these results in ℓ
p
norms, for every 2 < p ≤ ∞. In particular, for lattices of dimension n:
| •
|
Approximating the closest vector problem, the shortest vector problem, and other related problems to within  factors (or  factors, for p = ∞) is in coNP.
|
| •
|
Approximating the closest vector and bounded distance decoding problems with preprocessing to within  factors can be accomplished in deterministic polynomial time.
|
| •
|
Approximating several problems (such as the shortest independent vectors problem) to within Õ(n) factors in the worst case reduces to solving the average-case problems defined in prior works (Ajtai 2004; Micciancio & Regev 2007; Regev 2005).
|
Our results improve prior approximation factors for ℓ
p
norms by up to  factors. Taken all together, they complement recent reductions from the ℓ
2 norm to ℓ
p
norms (Regev & Rosen 2006), and provide some evidence that lattice problems in ℓ
p
norms (for p > 2) may not be substantially harder than they are in the ℓ
2 norm.
One of our main technical contributions is a very general analysis of Gaussian distributions over lattices, which may be of
independent interest. Our proofs employ analytical techniques of Banaszczyk that, to our knowledge, have yet to be exploited
in computer science.
Keywords. Lattices -
ℓ
p
norms - discrete Gaussians - worst-case to average-case reductions - cryptography
Subject classification. 68Q17 - 68Q25 - 11H06 - 94B75
Manuscript received 3 September 2007
Fulltext Preview (Small, Large)
|
|
|
|
|
|