Proceedings 2001 IEEE International Conference on Cluster Computing (2001)
Las Vegas, Nevada
Oct. 14, 2001 to Oct. 17, 2001
We prove a connection of the worst-case complexity to the average-case complexity based on the Closest Vector Problem (CVP) for lattices. Assume that there is an efficient algorithm which can solve approximately 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.
J. Cai, "On the Average-Case Hardness of CVP," Proceedings 2001 IEEE International Conference on Cluster Computing(FOCS), Las Vegas, Nevada, 2001, pp. 308.