A sieve algorithm for the shortest lattice vector problem

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 601-610

  Ajtai, M ^a   Kumar, R ^a   Sivakumar, D ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BLOCK CODES; BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY; VECTORS;

TIME ALGORITHMS;

COMPUTATION THEORY;

EID: 0034826416     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380857     Document Type: Conference Paper

References (13)

1. Generating hard instances of lattice problems
2. 2 is NP-hard for randomized reductions
3. Noise-tolerant learning, the parity problem, and the statistical query model
4. On the limits of nonapproximability of lattice problems
5. Algorithms to construct Minkowski reduced and Hermite reduced bases
6. Minkowski's convex body theorem and integer programming
7. Finding the closest lattice vector when it's unusually close
8. On polynomial approximations to the shortest lattice vector length
9. Factoring polynomials with rational coefficients
10. An algorithmic theory of numbers, graphs and convexity
11. The shortest vector in a lattice is hard to approximate to within some constant
12. A hierarchy of polynomial time basis reduction algorithms