New rank codes based encryption scheme using partial circulant matrices
From MaRDI portal
Publication:2334447
Recommendations
- A new encryption scheme based on rank metric codes
- A new rank metric codes based encryption scheme
- New technique for decoding codes in the rank metric and its cryptography applications
- New multivariate encryption scheme with low rank error-correcting codes
- Encryption schemes based on Hadamard matrices with circulant cores
- New Results for Rank-Based Cryptography
- An IND-CCA-secure code-based encryption scheme using rank metric
- scientific article; zbMATH DE number 789825
- Reducible rank codes and their applications to cryptography
- Identity-based encryption from codes with rank metric
Cites work
- scientific article; zbMATH DE number 1583768 (Why is no real title available?)
- scientific article; zbMATH DE number 1618037 (Why is no real title available?)
- scientific article; zbMATH DE number 177612 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- scientific article; zbMATH DE number 2154122 (Why is no real title available?)
- scientific article; zbMATH DE number 1440054 (Why is no real title available?)
- A new rank metric codes based encryption scheme
- Circulant Matrices and Algebraic Equations
- Column scrambler for the GPT cryptosystem
- Cryptanalysis of MinRank
- Designing a Rank Metric Based McEliece Cryptosystem
- Efficient Encryption From Random Quasi-Cyclic Codes
- Extension of Overbeck's attack for Gabidulin-based cryptosystems
- Fast decoding of Gabidulin codes
- Identity-based encryption from codes with rank metric
- Improved cryptanalysis of rank metric schemes based on Gabidulin codes
- Key recovery attack on McNie based on low rank parity check codes and its reparation
- Modified GPT PKC with right scrambler
- New Results for Rank-Based Cryptography
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- New technique for decoding codes in the rank metric and its cryptography applications
- 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 inherent intractability of certain coding problems (Corresp.)
- Progress in Cryptology - INDOCRYPT 2004
- Reducible rank codes and their applications to cryptography
- Secure integration of asymmetric and symmetric encryption schemes
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Theory of codes with maximum rank distance
Cited in
(9)- On the security of the modified dual-Ouroboros PKE using Gabidulin codes
- Combinatorial Rank Attacks Against the Rectangular Simple Matrix Encryption Scheme
- A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes
- An IND-CCA-secure code-based encryption scheme using rank metric
- Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018
- A new rank metric codes based encryption scheme
- New Results for Rank-Based Cryptography
- McEliece-type encryption based on Gabidulin codes with no hidden structure
- A new encryption scheme based on rank metric codes
This page was built for publication: New rank codes based encryption scheme using partial circulant matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334447)
