Information set decoding in the Lee metric with applications to cryptography
From MaRDI portal
Publication:825935
DOI10.3934/AMC.2020089OpenAlexW3038294435MaRDI QIDQ825935FDOQ825935
Authors: Anna-Lena Horlemann-Trautmann, Violetta Weger 
Publication date: 18 December 2021
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.07692
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
- 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})\)
- Attacking and Defending the McEliece Cryptosystem
- Information-set decoding for linear codes over \(\mathbb F_q\)
- Security bounds for the design of code-based cryptosystems
- Title not available (Why is that?)
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- Title not available (Why is that?)
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- 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
- Smaller decoding exponents: ball-collision decoding
- Kerdock code in a cyclic form
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
- Cyclic codes and quadratic residue codes over Z/sub 4/
- Codes over integer residue rings
- Codes over certain rings
- Grover vs. McEliece
- Decoding a class of Lee metric codes over a Galois ring
- Title not available (Why is that?)
- Algebraic coding theory
- Error-correcting codes: An axiomatic approach
- On BCH codes over arbitrary integer tings (Corresp.)
- On \(\mathbb{Z}_4\)-linear Goethals codes and Kloosterman sums
- On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
- On computing nearest neighbors with applications to decoding of binary linear codes
- Title not available (Why is that?)
- An introduction to ring-linear coding theory
- The complexity of information set decoding
- Codes over Zm
- Lee metric codes over integer residue rings (Corresp.)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lee-metric BCH codes and their application to constrained and partial-response channels
- A secret sharing scheme from a chain ring linear code
- Generalization of the Ball-Collision Algorithm
- Two decoding algorithms for linear codes
Cited In (13)
- On the design and security of Lee metric McEliece cryptosystems
- The weight distribution of codes over finite chain rings
- S-semantics -- an example
- Information-set decoding with hints
- On the hardness of the Lee syndrome decoding problem
- Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018
- Information set decoding for Lee-metric codes using restricted balls
- A complete structure of skew cyclic codes over \(\mathbb{Z}_4 + u \mathbb{Z}_4\)
- Density of free modules over finite chain rings
- 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
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)
