On the Complexity of the Rank Syndrome Decoding Problem
From MaRDI portal
Publication:2977019
DOI10.1109/TIT.2015.2511786zbMath1359.94847arXiv1301.1026OpenAlexW2134427743MaRDI QIDQ2977019
Julien Schrek, Olivier Ruatta, 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://arxiv.org/abs/1301.1026
Related Items (28)
Efficient key recovery for all HFE signature variants ⋮ On the security of the modified dual-Ouroboros PKE using Gabidulin codes ⋮ Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius ⋮ A Rank Attack Against Extension Field Cancellation ⋮ Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes ⋮ Improved cryptanalysis of rank metric schemes based on Gabidulin codes ⋮ Information security in a random network coding network ⋮ Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems ⋮ Revisiting algebraic attacks on MinRank and on the rank decoding problem ⋮ Code-Based Signature Schemes from Identification Protocols in the Rank Metric ⋮ Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018 ⋮ McEliece-type encryption based on Gabidulin codes with no hidden structure ⋮ MinRank in the head. Short signatures from zero-knowledge proofs ⋮ Extension of Overbeck's attack for Gabidulin-based cryptosystems ⋮ 2F -- a new method for constructing efficient multivariate encryption schemes ⋮ Algebraic relation of three MinRank algebraic modelings ⋮ 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 ⋮ An algebraic attack on rank metric code-based cryptosystems ⋮ Computer algebra tales on Goppa codes and McEliece cryptography ⋮ New rank codes based encryption scheme using partial circulant matrices ⋮ A gapless code-based hash proof system based on RQC and its applications ⋮ Rank-Metric Codes and Their Applications ⋮ A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes ⋮ A Practical Group Signature Scheme Based on Rank Metric ⋮ Decoding supercodes of Gabidulin codes and applications to cryptanalysis ⋮ An algebraic approach to the rank support learning problem
This page was built for publication: On the Complexity of the Rank Syndrome Decoding Problem
