On the average-case hardness of CVP

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 308-317

  Cai, J Y ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; INTEGER PROGRAMMING; MATRIX ALGEBRA; PERTURBATION TECHNIQUES; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; THEOREM PROVING; VECTORS;

CLOSEST VECTOR PROBLEM (CVP); LATTICE VECTORS;

COMPUTATIONAL COMPLEXITY;

EID: 0035181331     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. Generating hard instances of lattice problems
2. 2 is NP-hard for randomized reductions
3. A public-key cryptosystem with worst-case/average-case equivalence
4. A sieve algorithm for the shortest lattice vector problem
5. The hardness of approximate optima in lattices, codes, and systems of linear equations
6. On Lovász' lattice reduction and the nearest lattice point problem
7. Applications of a new transference theorem to Ajtai's connection factor
8. An improved worst-case to average-case connection for lattice problems
9. ε) is NP-hard under randomized reductions
10. On the complexity of computing short linearly independent vectors and short bases in a lattice
11. Approximating CVP to within almost-polynomial factors is NP-hard
12. A random polynomial time algorithm for approximating the volume of convex bodies
13. Publickey cryptosystems from lattice reduction problems
14. Isoperimetric problems for convex bodies and a localization lemma
15. The computational complexity of simultaneous diophantine approximation problems
16. Solving low-density subset sum problems
17. Factoring polynomials with rational coefficients
18. Integer programming with a fixed number of variables
19. The mixing rate of Markov chains, an isoperimetric inequality and computing the volume
20. The shortest vector in a lattice is hard to approximate to within some constant
21. Lattice reduction in cryptology: An update
22. Disproof of the Mertens conjecture
23. A hierarchy of polynomial time basis reduction algorithms