On Beating $2^n$ for the Closest Vector Problem

Amir Abboud, Rajendra Kumar

The Closest Vector Problem (CVP) is a computational problem in lattices that is central to modern cryptography. The study of its fine-grained complexity has gained momentum in the…