On the Maximum Distance Sublattice Problem and Closest Vector Problem
Computational Complexity
2024-10-02 v2 Cryptography and Security
Data Structures and Algorithms
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.
Cite
@article{arxiv.1811.03019,
title = {On the Maximum Distance Sublattice Problem and Closest Vector Problem},
author = {Rajendra Kumar and Shashank K Mehta and Mahesh Sreekumar Rajasree},
journal= {arXiv preprint arXiv:1811.03019},
year = {2024}
}
Comments
6 pages, Conference version SYNASC24