• Skip to primary navigation
  • Skip to main content
SRI logo
  • About
    • Press room
    • Our history
  • Expertise
    • Advanced imaging systems
    • Artificial intelligence
    • Biomedical R&D services
    • Biomedical sciences
    • Computer vision
    • Cyber & formal methods
    • Education and learning
    • Innovation strategy and policy
    • National security
    • Ocean & space
    • Quantum
    • QED-C
    • Robotics, sensors & devices
    • Speech & natural language
    • Video test & measurement
  • Ventures
  • NSIC
  • Careers
  • Contact
  • 日本支社
Search
Close
Publication May 1, 2008

Limits on the Hardness of Lattice Problems in L(P) Norms

Citation

Copy to clipboard


Peikert, C. Limits on the Hardness of Lattice Problems in ℓ p Norms. comput. complex. 17, 300–351 (2008). https://doi.org/10.1007/s00037-008-0251-3

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 𝑂(𝑛√)O(n) factors (or 𝑂(𝑛log𝑛‾‾‾‾‾‾√)O(nlog⁡n) factors, for p = ∞) is in coNP.
  • Approximating the closest vector and bounded distance decoding problems with preprocessing to within 𝑂(𝑛√)O(n) 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 𝑛√n 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.

↓ View online

Share this

How can we help?

Once you hit send…

We’ll match your inquiry to the person who can best help you.

Expect a response within 48 hours.

Career call to action image

Make your own mark.

Search jobs

Our work

Case studies

Publications

Timeline of innovation

Areas of expertise

Institute

Leadership

Press room

Media inquiries

Compliance

Careers

Job listings

Contact

SRI Ventures

Our locations

Headquarters

333 Ravenswood Ave
Menlo Park, CA 94025 USA

+1 (650) 859-2000

Subscribe to our newsletter


日本支社
SRI International
  • Contact us
  • Privacy Policy
  • Cookies
  • DMCA
  • Copyright © 2022 SRI International