A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes
From MaRDI portal
Publication:6204542
Recommendations
Cites work
- scientific article; zbMATH DE number 1618037 (Why is no real title available?)
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 177612 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- scientific article; zbMATH DE number 2009959 (Why is no real title available?)
- A New Randomness Extraction Paradigm for Hybrid Encryption
- A Polynomial-Time Attack on the BBCRS Scheme
- A new rank metric codes based encryption scheme
- Advances in Cryptology - EUROCRYPT 2004
- An algebraic attack on rank metric code-based cryptosystems
- Chosen-ciphertext security via correlated products
- Coding and Cryptography
- Coding and Cryptography
- Column scrambler for the GPT cryptosystem
- Cryptanalysis of MinRank
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- Enhanced public key security for the McEliece cryptosystem
- Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem
- Extension of Overbeck's attack for Gabidulin-based cryptosystems
- Fast decoding of Gabidulin codes
- Improved cryptanalysis of rank metric schemes based on Gabidulin codes
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- McEliece-type encryption based on Gabidulin codes with no hidden structure
- New Results for Rank-Based Cryptography
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- New rank codes based encryption scheme using partial circulant matrices
- 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 concatenated structure of a linear code
- On the inherent intractability of certain coding problems (Corresp.)
- On the security of a Loidreau rank metric code based encryption scheme
- Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes
- Progress in Cryptology - INDOCRYPT 2004
- Progress in Cryptology – Mycrypt 2005
- Reducible rank codes and their applications to cryptography
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- Structural attacks for public key cryptosystems based on Gabidulin codes
- The security of the Gabidulin public key cryptosystem
- Theory of codes with maximum rank distance
This page was built for publication: A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204542)
