The complexity of information set decoding
From MaRDI portal
Recommendations
Cited in
(18)- New approaches to reduced-complexity decoding
- Generalized information-set decoding of \((L,g)\)-codes
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Information-set decoding with hints
- Some cryptanalytic and coding-theoretic applications of a soft Stern algorithm
- Information sets in abelian codes: defining sets and Groebner basis
- On the complexity of suboptimal decoding for list and decision feedback schemes
- Analysis of information set decoding for a sub-linear error weight
- Faster 2-regular information-set decoding
- The hardness of decoding linear codes with preprocessing
- scientific article; zbMATH DE number 4077126 (Why is no real title available?)
- Code-based cryptosystems using generalized concatenated codes
- scientific article; zbMATH DE number 922628 (Why is no real title available?)
- Time-memory tradeoffs for large-weight syndrome decoding in ternary codes
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
- An algorithm for generalized syndrome decoding problem
- Improved information set decoding algorithms over Galois ring in the Lee metric
- Information set decoding in the Lee metric with applications to cryptography
This page was built for publication: The complexity of information set decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3986470)