Randomized decoding of Gabidulin codes beyond the unique decoding radius

DOI10.1007/978-3-030-44223-1_1MaRDI QIDQ5041210zbMATH OpenOpenAlexFDO

Authors Julian Renner, Thomas Jerkovits, Hannes Bartz, Sven Puchinger, Pierre Loidreau, Antonia Wachter-Zeh

Publication date 13 October 2022

Published in Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1911.13193

zbMATH Keywords

code-based cryptographydecodingGabidulin codesrank metric

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Theory of error-correcting codes and error-detecting codes (94Bxx)

Recommendations

• Decoding supercodes of Gabidulin codes and applications to cryptanalysis
• Fast decoding of Gabidulin codes
• Algebraic decoding of folded Gabidulin codes
• Erasure decoding for Gabidulin codes
• On the list decodability of rank-metric codes containing Gabidulin codes

Cites work

• scientific article; zbMATH DE number 177612 (Why is no real title available?)
• scientific article; zbMATH DE number 503206 (Why is no real title available?)
• scientific article; zbMATH DE number 2009958 (Why is no real title available?)
• A Rank-Metric Approach to Error Control in Random Network Coding
• A module minimization approach to Gabidulin decoding via interpolation
• Bilinear forms over a finite field, with applications to coding theory
• Bounds on List Decoding of Rank-Metric Codes
• Coding and Cryptography
• Coding for Errors and Erasures in Random Network Coding
• Error and erasure correcting algorithms for rank codes
• Error-Correcting Codes in Projective Space
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
• Maximum-rank array codes and their application to crisscross error correction
• On the Complexity of the Rank Syndrome Decoding Problem
• On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
• On the List Decodability of Rank Metric Codes
• On the inherent intractability of certain coding problems (Corresp.)
• Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes
• Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius
• Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes
• The intractability of computing the minimum distance of a code
• Theory of codes with maximum rank distance
• Weak keys in the Faure-Loidreau cryptosystem

Cited in

(7)

• Erasure decoding for Gabidulin codes
• Decoding supercodes of Gabidulin codes and applications to cryptanalysis
• On the list decodability of rank-metric codes containing Gabidulin codes
• Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
• Rank-metric codes and their applications
• Algebraic decoding of folded Gabidulin codes
• Coding and Cryptography

This page was built for publication: Randomized decoding of Gabidulin codes beyond the unique decoding radius

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041210)