Limits on the hardness of lattice problems in ℓp norms

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2007, Pages 333-346

  Peikert, Chris ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SCIENCE; GAUSSIAN DISTRIBUTION; THEOREM PROVING; VECTOR QUANTIZATION;

AVERAGE CASE PROBLEMS; LATTICE PROBLEMS;

PROBLEM SOLVING;

EID: 34748825156     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2007.12     Document Type: Conference Paper

References (30)

1. D. Aharonov and O. Regev. A lattice problem in quantum NP. In FOCS, pages 210-219. IEEE Computer Society, 2003.
2. D. Aharonov and O. Regev. Lattice problems in NP n coNP. J. ACM, 52(5):749-765, 2005.
3. M. Ajtai. Generating hard instances of lattice problems (extended abstract). In STOC, pages 99-108, 1996.
4. M. Ajtai, R. Kumar, and D. Sivakumar. A sieve algorithm for the shortest lattice vector problem. In STOC, pages 601-610, 2001.
5. M. Alekhnovich, S. Khot, G. Kindler, and N. K. Vishnoi. Hardness of approximating the closest vector problem with pre-processing. In FOCS, pages 216-225. IEEE Computer Society, 2005.
6. L. Babai. On Lovász' lattice reduction and the nearest lattice point problem. Combinatorica, 6(1):1-13, 1986.
7. W. Banaszczyk. New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen, 296(4):625-635, 1993.
8. n. Discrete & Computational Geometry, 13:217-231, 1995.
9. S. Ben-David, B. Chor, O. Goldreich, and M. Luby. On the theory of average case complexity. J. Comput. Syst. Sci., 44(2):193-219, 1992.
10. J. Blömer and J.-P. Seifert. On the complexity of computing short linearly independent vectors and short bases in a lattice. In STOC, pages 711-720, 1999.
11. ∞ to within almost-polynomial factors is NP-hard. Theor. Comput. Sci., 285(1):55-71, 2002.
12. I. Dinur, G. Kindler, R. Raz, and S. Safra. Approximating CVP to within almost-polynomial factors is NP-hard. Combinatorica, 23(2):205-243, 2003.
13. U. Feige and D. Micciancio. The inapproximability of lattice and coding problems with preprocessing. J. Comput. Syst. ScL, 69(1):45-67, 2004.
14. O. Goldreich. Note available at http://www.wisdom.weizmann.ac.il/ ~odeoVp_lp.html.
15. O. Goldreich and S. Goldwasser. On the limits of non-approximability of lattice problems. J. Comput. Syst. Sci., 60(3):540-563, 2000.
16. O. Goldreich, D. Micciancio, S. Safra, and J.-P. Seifert. Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Inf. Process. Lett., 71(2):55-61, 1999.
17. V. Guruswami, D. Micciancio, and O. Regev. The complexity of the covering radius problem on lattices and codes. In IEEE Conference on Computational Complexity, pages 161-173. IEEE Computer Society, 2004.
18. I. Haviv and O. Regev. Tensor-based hardness of the shortest vector problem to within almost polynomial factors. In STOC, 2007.
19. S. Khot. Hardness of approximating the shortest vector problem in lattices. J. ACM, 52(5):789-808, 2005.
20. A. K. Lenstra, H. W. Lenstra, and L. Lovász. Factoring polynomials with rational coefficients. Mathematische Annalen, 261(4):515-534, December 1982.
21. L. A. Levin. Average case complete problems. SIAM J. Comput, 15(1):285-286, 1986.
22. Y.-K. Liu, V. Lyubashevsky, and D. Micciancio. On bounded distance decoding for general lattices. In Proceedings of RANDOM 2006, August 2006.
23. V. Lyubashevsky and D. Micciancio. Generalized compact knapsacks are collision resistant. In ICALP (2), volume 4052 of Lecture Notes in Computer Science, pages 144-155. Springer, 2006. Full version in ECCC Report TR05-142.
24. D. Micciancio and S. Goldwasser. Complexity of Lattice Problems: a cryptographic perspective, volume 671 of The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston, Massachusetts, 2002.
25. D. Micciancio and O. Regev. Worst-case to average-case reductions based on Gaussian measures. In FOCS, pages 372-381. IEEE Computer Society, 2004.
26. C. Peikert and A. Rosen. Lattices that admit logarithmic worst-case to average-case connection factors. In STOC, 2007. Full version in ECCC Report TR06-147.
27. O. Regev. New lattice-based cryptographic constructions. J. ACM, 51(6):899-942, 2004.
28. O. Regev. On lattices, learning with errors, random linear codes, and cryptography. In STOC, pages 84-93. ACM, 2005.
29. O. Regev and R. Rosen. Lattice problems and norm embeddings. In STOC, pages 447-456. ACM, 2006.
30. C-P. Schnorr. A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci., 53:201-224, 1987.