New technique for decoding codes in the rank metric and its cryptography applications
From MaRDI portal
Publication:1812362
DOI10.1023/A:1020369320078zbMath1026.94023OpenAlexW1892123666MaRDI QIDQ1812362
Publication date: 3 December 2003
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1020369320078
Related Items (20)
Information security in a random network coding network ⋮ On the complexity of the generalized MinRank problem ⋮ 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 ⋮ Structural attacks for public key cryptosystems based on Gabidulin codes ⋮ Extension of Overbeck's attack for Gabidulin-based cryptosystems ⋮ Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity ⋮ 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 ⋮ Asymptotic behaviour of codes in rank metric over finite fields ⋮ Multilinear polynomial systems: root isolation and bit complexity ⋮ An algebraic attack on rank metric code-based cryptosystems ⋮ Full Cryptanalysis of the Chen Identification Protocol ⋮ New rank codes based encryption scheme using partial circulant matrices ⋮ 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: New technique for decoding codes in the rank metric and its cryptography applications
