Title :
On the average-case hardness of CVP
Author_Institution :
Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA
Abstract :
We prove a connection of the worst-case complexity to the average-case complexity based on the Closest Vector Problem (CVP) for lattices. We assume that there is an efficient algorithm which can approximately solve a random instance of CVP, with a non-trivial success probability. For lattices under a certain natural distribution, we show that one can approximately solve several lattice problems (including a version of CVP) efficiently for every lattice with high probability.
Keywords :
computational complexity; probability; vectors; CVP; Closest Vector Problem; average-case complexity; average-case hardness; lattice problems; natural distribution; non-trivial success probability; random instance; worst-case complexity; Computer science; Councils; Distributed computing; Lattices; Linear programming; Polynomials; Probability distribution; Tellurium;
Conference_Titel :
Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on
Print_ISBN :
0-7695-1116-3
DOI :
10.1109/SFCS.2001.959905
