Information set decoding in the Lee metric with applications to cryptography
type: Item
instance of: scholarly article
title: Information set decoding in the Lee metric with applications to cryptography
author: Anna-Lena Horlemann-Trautmann
author: Violetta Weger
published in: Advances in Mathematics of Communications
publication date: 2021-12-18T00:00:00Z
full work available at URL: https://arxiv.org/abs/1903.07692
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94B35
zbMATH DE Number: 7449473
zbMATH Keywords: coding theory
zbMATH Keywords: cryptography
zbMATH Keywords: McEliece system
zbMATH Keywords: ring-linear codes
zbMATH Keywords: Lee metric
MaRDI profile type: Publication
OpenAlex ID: W3038294435
cites work: Error-correcting codes: An axiomatic approach
cites work: Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
cites work: Algebraic Coding Theory
cites work: Grover vs. McEliece
cites work: Attacking and Defending the McEliece Cryptosystem
cites work: Smaller Decoding Exponents: Ball-Collision Decoding
cites work: Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
cites work: Codes over certain rings
cites work: Codes over integer residue rings
cites work: Decoding a class of Lee metric codes over a Galois ring
cites work: 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
cites work: Q4249266
cites work: Q4276334
cites work: The complexity of information set decoding
cites work: Two decoding algorithms for linear codes
cites work: Security Bounds for the Design of Code-Based Cryptosystems
cites work: An Introduction to Ring-Linear Coding Theory
cites work: The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
cites work: On \(\mathbb{Z}_4\)-linear Goethals codes and Kloosterman sums
cites work: Generalization of the Ball-Collision Algorithm
cites work: Q4204104
cites work: Q3803024
cites work: A probabilistic algorithm for computing minimum weights of large error-correcting codes
cites work: Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
cites work: On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
cites work: Kerdock code in a cyclic form
cites work: On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
cites work: Information-Set Decoding for Linear Codes over F q
cites work: Cyclic codes and quadratic residue codes over Z/sub 4/
cites work: Lee-metric BCH codes and their application to constrained and partial-response channels
cites work: Lee metric codes over integer residue rings (Corresp.)
cites work: On BCH codes over arbitrary integer tings (Corresp.)
cites work: Codes over Zm
cites work: Q3835408
cites work: Q5443159
cites work: Q3202943
DOI: 10.3934/AMC.2020089
description: scientific article; zbMATH DE number 7449473