The syndrome decoding problem is one of the NP-complete problems lying at the foundation of code-based cryptography. The variant thereof where the distance between vectors is measured with respect to the Lee metric, rather than the more commonly used Hamming metric, has been analyzed recently in several works due to its potential relevance for building more efficient code-based cryptosystems. The purpose of this article is to describe a zero-knowledge proof for this variant of the problem.
View on arXiv@article{kovačević2025_2502.11641,
title={ A Zero-Knowledge Proof for the Syndrome Decoding Problem in the Lee Metric },
author={ Mladen Kovačević and Tatjana Grbić and Darko Čapko and Nemanja Nedić and Srdjan Vukmirović },
journal={arXiv preprint arXiv:2502.11641},
year={ 2025 }
}