On the Maximum Distance Sublattice Problem and Closest Vector Problem
Rajendra Kumar, Shashank K. Mehta, Rajasree, Mahesh Sreekumar · arXiv (Cornell University) · 2018
In this paper, we introduce the Maximum Distance Sublattice Problem (MDSP). We observed that the problem of solving an instance of the Closest Vector Problem (CVP) in a lattice $\mathcal{L}$ is the same as solving an instance of MDSP in the dual lattice of $\mathcal{L}$. We give an alternate reduction between the CVP and MDSP. This alternate reduction does not use the concept of dual lattice.