Information set decoding in the Lee metric with applications to cryptography
From MaRDI portal
Publication:825935
DOI10.3934/amc.2020089OpenAlexW3038294435MaRDI QIDQ825935
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
Related Items (11)
Density of free modules over finite chain rings ⋮ Information-set decoding with hints ⋮ On the hardness of the Lee syndrome decoding problem ⋮ S-semantics -- an example ⋮ Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018 ⋮ Interleaved Prange: a new generic decoder for interleaved codes ⋮ On the (in)security of optimized Stern-like signature schemes ⋮ Improved information set decoding algorithms over Galois ring in the Lee metric ⋮ The weight distribution of codes over finite chain rings ⋮ Information set decoding for Lee-metric codes using restricted balls ⋮ On the design and security of Lee metric McEliece cryptosystems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two decoding algorithms for linear codes
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
- 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
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Kerdock code in a cyclic form
- Attacking and Defending the McEliece Cryptosystem
- Grover vs. McEliece
- Information-Set Decoding for Linear Codes over F q
- Security Bounds for the Design of Code-Based Cryptosystems
- An Introduction to Ring-Linear Coding Theory
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- On BCH codes over arbitrary integer tings (Corresp.)
- The complexity of information set decoding
- Codes over integer residue rings
- Codes over Zm
- Lee metric codes over integer residue rings (Corresp.)
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- Lee-metric BCH codes and their application to constrained and partial-response channels
- 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
- Decoding a class of Lee metric codes over a Galois ring
- Cyclic codes and quadratic residue codes over Z/sub 4/
- Smaller Decoding Exponents: Ball-Collision Decoding
- Algebraic Coding Theory
- Codes over certain rings
- Error-correcting codes: An axiomatic approach
- Generalization of the Ball-Collision Algorithm
This page was built for publication: Information set decoding in the Lee metric with applications to cryptography
