Sampling short lattice vectors and the closest lattice vector problem

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2002, Pages 53-57

  Ajtai, Miklós ^a   Kumar, Ravi ^a   Sivakumar, D ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036287568     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. A sieve algorithm for the shortest lattice vector problem
2. Closest vectors, successive minima, and dual HKZ-bases of lattices
3. On Lováisz' lattice reduction and the nearest lattice point problem
4. On the average-case hardness of CVP
5. Approximating CVP to within almost polynomial factors is NP-hard
6. On the limits of non-approximability of lattice problems
7. Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
8. Algorithms to construct Minkowski reduced and Hermite reduced bases
9. Minkowski's convex body theorem and integer programming
10. Finding the closest lattice vector when it's unusually close
11. Factoring polynomials with rational coefficients