On bounded distance decoding for general lattices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4110 LNCS, Issue , 2006, Pages 450-461

  Liu, Yi Kai ^a   Lyubashevsky, Vadim ^a   Micciancio, Daniele ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING; VECTORS;

CLOSEST VECTOR PROBLEM; CODING THEORY; LATTICE POINTS;

DECODING;

EID: 33750038259     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11830924_41     Document Type: Conference Paper

References (23)

1. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger. Closest point search in lattices. IEEE Trans. on Inf. Theory, 48(8):2201-2214, 2002.
2. D. Aharonov and O. Regev. Lattice problems in NP ∩ coNP. Journal of the ACM, 52(5):749-765, 2005.
3. M. Ajtai, R. Kumar, and D. Sivakumar. Sampling short lattice vectors and the closest lattice vector problem. In CCC, pages 53-57, 2002.
4. M. Alekhnovich, S. Khot, G. Kindler, and N. Vishnoi. Hardness of approximating the closest vector problem with pre-processing. In FOCS, 2005.
5. S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear equations. Journal of Computer and System Sciences, 54(2):317-331, 1997.
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. A. H. Banihashemi and A. K. Khandani. On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis. IEEE Trans. on Inf. Theory, 44(1):162-171, January 1998.
9. 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.
10. I. Dumer, D. Micciancio, and M. Sudan. Hardness of approximating the minimum distance of a linear code. IEEE Trans. on Inf. Theory, 49(1):22-37, January 2003.
11. U. Feige and D. Micciancio. The inapproximability of lattice and coding problems with preprocessing. Journal of Computer and System Sciences, 69(1):45-67.
12. S. Khot. Hardness of approximating the shortest vector problem in lattices. In FOCS, pages 126-135, 2004.
13. P. Klein. Finding the closest lattice vector when it's unusually close. In SODA, pages 937-941, 2000.
14. J. C. Lagarias, H. W. Lenstra Jr., and C. P. Schnorr. Korkin-zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica, 10(4):333-348, 1990.
15. D. Micciancio. The hardness of the closest vector problem with preprocessing. IEEE Trans. on Inf. Theory, 47(3):1212-1215, 2001.
16. D. Micciancio. The shortest vector problem is NP-hard to approximate to within some constant. SIAM J. on Computing, 30(6):2008-2035, 2001.
17. D. Micciancio and S. Goldwasser. Complexity Of Lattice Problems: A Cryptographic Perspective. Kluwer Academic Publishers, 2002.
18. O. Regev. Improved inapproximability of lattice and coding problems with preprocessing. IEEE Trans. on Inf. Theory, 50(9):2031-2037, 2004.
19. O. Regev and R. Rosen. Lattice problems and norm embeddings. In STOC, 2006.
20. I.J. Schoenberg. Metric spaces and positive definite functions. Trans. Amer. Math. Soc., 44(3):522-536, 1938.
21. D. Stefankovic. Fourier transforms in computer science. Master's thesis, University of Chicago, 2000.
22. J. Stewart. Positive definite functions and generalizations, an historical survey. Rocky Mountain J. Math, 6(3), 1976.
23. A. Vardy. Algorithmic complexity in coding theory and the minimum distance problem. In STOC, pages 92-109, 1997.