A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes
From MaRDI portal
Publication:6204542
DOI10.1016/J.TCS.2024.114480MaRDI QIDQ6204542FDOQ6204542
Authors: Zhe Sun, Jincheng Zhuang, Zimeng Zhou, Fangwei Fu
Publication date: 28 March 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
code-based cryptographyrank metricIND-CCA2McEliece-type cryptosystemGabidulin-Kronecker product codes
Cites Work
- Title not available (Why is that?)
- Column scrambler for the GPT cryptosystem
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Enhanced public key security for the McEliece cryptosystem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- Title not available (Why is that?)
- On the inherent intractability of certain coding problems (Corresp.)
- Title not available (Why is that?)
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
- Theory of codes with maximum rank distance
- Title not available (Why is that?)
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- Cryptanalysis of MinRank
- Coding and Cryptography
- New technique for decoding codes in the rank metric and its cryptography applications
- On the Complexity of the Rank Syndrome Decoding Problem
- Advances in Cryptology - EUROCRYPT 2004
- Fast decoding of Gabidulin codes
- A New Randomness Extraction Paradigm for Hybrid Encryption
- On the concatenated structure of a linear code
- Progress in Cryptology – Mycrypt 2005
- A new rank metric codes based encryption scheme
- Extension of Overbeck's attack for Gabidulin-based cryptosystems
- An algebraic attack on rank metric code-based cryptosystems
- New rank codes based encryption scheme using partial circulant matrices
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
- New Results for Rank-Based Cryptography
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- The security of the Gabidulin public key cryptosystem
- Reducible rank codes and their applications to cryptography
- Coding and Cryptography
- Improved cryptanalysis of rank metric schemes based on Gabidulin codes
- Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem
- 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
- Chosen-ciphertext security via correlated products
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- A Polynomial-Time Attack on the BBCRS Scheme
- Progress in Cryptology - INDOCRYPT 2004
- McEliece-type encryption based on Gabidulin codes with no hidden structure
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)