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.

翻译：本文引入了最大距离子格问题（MDSP）。我们观察到，在格 $\mathcal{L}$ 中求解最近向量问题（CVP）实例等价于在 $\mathcal{L}$ 的对偶格中求解 MDSP 实例。我们给出了 CVP 与 MDSP 之间的另一种归约方法，该归约无需借助对偶格的概念。