Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
From MaRDI portal
Publication:2118524
DOI10.1007/978-3-030-81293-5_3zbMATH Open1485.94068OpenAlexW3165281604MaRDI QIDQ2118524FDOQ2118524
Abstract: The security of code-based cryptography usually relies on the hardness of the syndrome decoding (SD) problem for the Hamming weight. The best generic algorithms are all improvements of an old algorithm by Prange, and they are known under the name of Information Set Decoding (ISD) algorithms. This work aims to extend ISD algorithms' scope by changing the underlying weight function and alphabet size of SD. More precisely, we show how to use Wagner's algorithm in the ISD framework to solve SD for a wide range of weight functions. We also calculate the asymptotic complexities of ISD algorithms both in the classical and quantum case. We then apply our results to the Lee metric, which currently receives a significant amount of attention. By providing the parameters of SD for which decoding in the Lee weight seems to be the hardest, our study could have several applications for designing code-based cryptosystems and their security analysis, especially against quantum adversaries.
Recommendations
- Information set decoding for Lee-metric codes using restricted balls
- Information set decoding in the Lee metric with applications to cryptography
- An algorithm for generalized syndrome decoding problem
- Quantum information set decoding algorithms
- Hybrid decoding -- classical-quantum trade-offs for information set decoding
Cites Work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1942427 (Why is no real title available?)
- scientific article; zbMATH DE number 1545673 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 910958 (Why is no real title available?)
- An algebraic attack on rank metric code-based cryptosystems
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Durandal: a rank metric based signature scheme
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- On computing nearest neighbors with applications to decoding of binary linear codes
- On the asymptotic behaviour of Lee-codes
- On the inherent intractability of certain coding problems (Corresp.)
- Quantum information set decoding algorithms
- Ternary Syndrome Decoding with large weight
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
Cited In (12)
- Information set decoding in the Lee metric with applications to cryptography
- An algorithm for generalized syndrome decoding problem
- Hybrid decoding -- classical-quantum trade-offs for information set decoding
- Time-memory tradeoffs for large-weight syndrome decoding in ternary codes
- On the hardness of the Lee syndrome decoding problem
- Information set decoding for Lee-metric codes using restricted balls
- Ternary Syndrome Decoding with large weight
- Wave Parameter Selection
- Interleaved Prange: a new generic decoder for interleaved codes
- \textsf{FuLeeca}: a Lee-based signature scheme
- On the (in)security of optimized Stern-like signature schemes
- Improved information set decoding algorithms over Galois ring in the Lee metric
Uses Software
This page was built for publication: Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118524)
