New rank codes based encryption scheme using partial circulant matrices
From MaRDI portal
Publication:2334447
DOI10.1007/s10623-019-00659-0zbMath1423.94153OpenAlexW2954142464WikidataQ121822283 ScholiaQ121822283MaRDI QIDQ2334447
Terry Shue Chien Lau, Chik How Tan
Publication date: 7 November 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-019-00659-0
Related Items (4)
On the security of the modified dual-Ouroboros PKE using Gabidulin codes ⋮ Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018 ⋮ McEliece-type encryption based on Gabidulin codes with no hidden structure ⋮ A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theory of codes with maximum rank distance
- Improved cryptanalysis of rank metric schemes based on Gabidulin codes
- A new rank metric codes based encryption scheme
- Identity-based encryption from codes with rank metric
- Extension of Overbeck's attack for Gabidulin-based cryptosystems
- Key recovery attack on McNie based on low rank parity check codes and its reparation
- Column scrambler for the GPT cryptosystem
- New technique for decoding codes in the rank metric and its cryptography applications
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- Fast decoding of Gabidulin codes
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- Structural attacks for public key cryptosystems based on Gabidulin codes
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
- On the Complexity of the Rank Syndrome Decoding Problem
- Reducible rank codes and their applications to cryptography
- Designing a Rank Metric Based McEliece Cryptosystem
- Cryptanalysis of MinRank
- Circulant Matrices and Algebraic Equations
- On the inherent intractability of certain coding problems (Corresp.)
- Secure integration of asymmetric and symmetric encryption schemes
- New Results for Rank-Based Cryptography
- Efficient Encryption From Random Quasi-Cyclic Codes
- Progress in Cryptology - INDOCRYPT 2004
This page was built for publication: New rank codes based encryption scheme using partial circulant matrices
