Work

On the Maximum Distance Sublattice Problem and Closest Vector Problem

Year: 2024

Type: conference-paper

Abstract: In this paper, we introduce the Maximum Distance Sublattice Problem ($\mathsf{MDSP}$). We observed that the problem of solving an instance of the Closest Vector Problem ($\mathsf{CVP}$) in a lattice$\mathcal{L}$is the same as solving an instance of$\mathsf{MDSP}$in the dual lattice of$\mathcal{L}$. We give an alternate reduction between the$\mathsf{CVP}$and$\mathsf{MDSP}$. This alternate reduction does not use the concept of dual lattice.

Source: International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

DOI: 10.1109/synasc65383.2024.00033

Authors: Rajendra Kumar, Shashank K Mehta, Mahesh Sreekumar Rajasree

Institutions: Indian Institute of Technology Delhi, Indian Institute of Technology Kanpur

Language: English

Topic: Cryptography and Data Security

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4407950563

FWCI:

Cites: 41

Cited by:

Related to: 10