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

February 17, 2025 Β· Declared Dead Β· πŸ› IACR Cryptology ePrint Archive

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Mladen KovačeviΔ‡, Tatjana GrbiΔ‡, Darko Čapko, Nemanja NediΔ‡, Srdjan VukmiroviΔ‡ arXiv ID 2502.11641 Category cs.CR: Cryptography & Security Cross-listed cs.IT Citations 0 Venue IACR Cryptology ePrint Archive Last Checked 4 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

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

πŸ“œ Similar Papers

In the same crypt β€” Cryptography & Security

Died the same way β€” πŸ‘» Ghosted