Information set decoding in the Lee metric with applications to cryptography
From MaRDI portal
Publication:825935
Recommendations
- On the design and security of Lee metric McEliece cryptosystems
- Information set decoding for Lee-metric codes using restricted balls
- Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
- Information-set decoding for linear codes over \(\mathbb F_q\)
- Analysis of information set decoding for a sub-linear error weight
Cites work
- scientific article; zbMATH DE number 4179278 (Why is no real title available?)
- scientific article; zbMATH DE number 4070796 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 4123671 (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?)
- 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 probabilistic algorithm for computing minimum weights of large error-correcting codes
- A secret sharing scheme from a chain ring linear code
- Algebraic coding theory
- An introduction to ring-linear coding theory
- Attacking and Defending the McEliece Cryptosystem
- Codes over Zm
- Codes over certain rings
- Codes over integer residue rings
- Cyclic codes and quadratic residue codes over Z/sub 4/
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding a class of Lee metric codes over a Galois ring
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Error-correcting codes: An axiomatic approach
- Generalization of the ball-collision algorithm
- Grover vs. McEliece
- Information-set decoding for linear codes over \(\mathbb F_q\)
- Kerdock code in a cyclic form
- Lee metric codes over integer residue rings (Corresp.)
- Lee-metric BCH codes and their application to constrained and partial-response channels
- On BCH codes over arbitrary integer tings (Corresp.)
- On \(\mathbb{Z}_4\)-linear Goethals codes and Kloosterman sums
- 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
- Security bounds for the design of code-based cryptosystems
- Smaller decoding exponents: ball-collision decoding
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- The complexity of information set decoding
- Two decoding algorithms for linear codes
Cited in
(14)- Information-set decoding with hints
- On the design and security of Lee metric McEliece cryptosystems
- Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
- \textsf{FuLeeca}: a Lee-based signature scheme
- The weight distribution of codes over finite chain rings
- A complete structure of skew cyclic codes over \(\mathbb{Z}_4 + u \mathbb{Z}_4\)
- On the hardness of the Lee syndrome decoding problem
- Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018
- Density of free modules over finite chain rings
- S-semantics -- an example
- Interleaved Prange: a new generic decoder for interleaved codes
- Information set decoding for Lee-metric codes using restricted balls
- On the (in)security of optimized Stern-like signature schemes
- Improved information set decoding algorithms over Galois ring in the Lee metric
This page was built for publication: Information set decoding in the Lee metric with applications to cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q825935)
