A Zero-Knowledge Proof for the Syndrome Decoding Problem in the Lee Metric

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Kovačević, Mladen, Grbić, Tatjana, Čapko, Darko, Nedić, Nemanja, Vukmirović, Srdjan
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914022916358144
author Kovačević, Mladen
Grbić, Tatjana
Čapko, Darko
Nedić, Nemanja
Vukmirović, Srdjan
author_facet Kovačević, Mladen
Grbić, Tatjana
Čapko, Darko
Nedić, Nemanja
Vukmirović, Srdjan
contents 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 present a zero-knowledge proof of knowledge for this variant of the problem.
format Preprint
id arxiv_https___arxiv_org_abs_2502_11641
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle A Zero-Knowledge Proof for the Syndrome Decoding Problem in the Lee Metric
Kovačević, Mladen
Grbić, Tatjana
Čapko, Darko
Nedić, Nemanja
Vukmirović, Srdjan
Cryptography and Security
Information Theory
94A60, 68P25
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 present a zero-knowledge proof of knowledge for this variant of the problem.
title A Zero-Knowledge Proof for the Syndrome Decoding Problem in the Lee Metric
topic Cryptography and Security
Information Theory
94A60, 68P25
url https://arxiv.org/abs/2502.11641