On the hardness of the Lee syndrome decoding problem

DOI10.3934/amc.2022029zbMath1529.94057arXiv2002.12785OpenAlexW3017785777MaRDI QIDQ6089464

Karan Khathuria, Edoardo Persichetti, Paolo Maria Santíni, Massimo Battaglioni, Violetta Weger, Anna-Lena Horlemann

Publication date: 14 December 2023

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.12785

zbMATH Keywords

syndrome decodingLee metricinformation set decoding

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Decoding (94B35)

Related Items (1)

On the (in)security of optimized Stern-like signature schemes

Cites Work

• Codes, cryptology and information security. Second international conference, C2SI 2017, Rabat, Morocco, April 10--12, 2017. Proceedings -- in honor of Claude Carlet
• On the asymptotic behaviour of Lee-codes
• Information set decoding in the Lee metric with applications to cryptography
• Some new NP-complete coding problems
• LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes
• Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
• Density of free modules over finite chain rings
• On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
• Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
• Information-Set Decoding for Linear Codes over F q
• Security Bounds for the Design of Code-Based Cryptosystems
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• On the inherent intractability of certain coding problems (Corresp.)
• A new identification scheme based on syndrome decoding
• A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
• Generic Decoding in the Sum-Rank Metric
• Smaller Decoding Exponents: Ball-Collision Decoding
• Generalization of the Ball-Collision Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the hardness of the Lee syndrome decoding problem