On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
From MaRDI portal
Publication:2976445
DOI10.1109/TIT.2016.2616127zbMath1359.94848OpenAlexW2963320596MaRDI QIDQ2976445
Gilles Zémor, Philippe Gaborit
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2016.2616127
Related Items (20)
On the security of the modified dual-Ouroboros PKE using Gabidulin codes ⋮ Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius ⋮ Revisiting algebraic attacks on MinRank and on the rank decoding problem ⋮ On the hardness of the Lee syndrome decoding problem ⋮ Code-Based Signature Schemes from Identification Protocols in the Rank Metric ⋮ LRPC codes with multiple syndromes: near ideal-size KEMs without ideals ⋮ Improved information set decoding algorithms over Galois ring in the Lee metric ⋮ McEliece-type encryption based on Gabidulin codes with no hidden structure ⋮ A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes ⋮ Improvements of algebraic attacks for solving the rank decoding and MinRank problems ⋮ Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge ⋮ A modified Dual-Ouroboros public-key encryption using Gabidulin codes ⋮ An algebraic attack on rank metric code-based cryptosystems ⋮ Cryptanalysis of a rank-based signature with short public keys ⋮ New rank codes based encryption scheme using partial circulant matrices ⋮ A gapless code-based hash proof system based on RQC and its applications ⋮ A new post-quantum multivariate polynomial public key encapsulation algorithm ⋮ Rank-Metric Codes and Their Applications ⋮ A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes ⋮ An algebraic approach to the rank support learning problem
This page was built for publication: On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
