On the Maximum Distance Sublattice Problem and Closest Vector Problem

November 07, 2018 · The Ethereal · 🏛 Symposium on Symbolic and Numeric Algorithms for Scientific Computing

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Rajendra Kumar, Shashank K Mehta, Mahesh Sreekumar Rajasree arXiv ID 1811.03019 Category cs.CC: Computational Complexity Cross-listed cs.CR, cs.DS Citations 0 Venue Symposium on Symbolic and Numeric Algorithms for Scientific Computing Last Checked 3 months ago
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 $\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.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Computational Complexity