Improved information set decoding algorithms over Galois ring in the Lee metric
From MaRDI portal
Publication:6131036
Recommendations
- Information set decoding in the Lee metric with applications to cryptography
- Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
- Information set decoding for Lee-metric codes using restricted balls
- On the hardness of the Lee syndrome decoding problem
- Information-set decoding for linear codes over \(\mathbb F_q\)
Cites work
- scientific article; zbMATH DE number 4179278 (Why is no real title available?)
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 4070796 (Why is no real title available?)
- scientific article; zbMATH DE number 3557797 (Why is no real title available?)
- scientific article; zbMATH DE number 1302794 (Why is no real title available?)
- scientific article; zbMATH DE number 493091 (Why is no real title available?)
- scientific article; zbMATH DE number 2081064 (Why is no real title available?)
- 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
- A new identification scheme based on syndrome decoding
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- A zero-knowledge identification scheme based on the \(q\)-ary syndrome decoding problem
- Analysis of information set decoding for a sub-linear error weight
- Attacking and Defending the McEliece Cryptosystem
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding one out of many
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Generalization of the ball-collision algorithm
- Improved identification schemes based on error-correcting codes
- Information set decoding in the Lee metric with applications to cryptography
- Information-set decoding for linear codes over \(\mathbb F_q\)
- Introduction to Coding Theory
- On computing nearest neighbors with applications to decoding of binary linear codes
- On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
- On the inherent intractability of certain coding problems (Corresp.)
- Security bounds for the design of code-based cryptosystems
- Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation
- Smaller decoding exponents: ball-collision decoding
- Some new NP-complete coding problems
- Ternary Syndrome Decoding with large weight
- The complexity of information set decoding
- Two decoding algorithms for linear codes
This page was built for publication: Improved information set decoding algorithms over Galois ring in the Lee metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131036)
