paper

On the Maximum Distance Sublattice Problem and Closest Vector Problem

arXiv:1811.03019

Abstract

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 is the same as solving an instance of MDSP in the dual lattice of . We give an alternate reduction between the CVP and MDSP. This alternate reduction does not use the concept of dual lattice.

6 pages, Conference version SYNASC24

On the Maximum Distance Sublattice Problem and Closest Vector Problem · wovepaper