Two modifications for Loidreau's code-based cryptosystem
From MaRDI portal
Publication:6602397
Recommendations
- Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018
- Cryptanalysis of Rank-Metric Schemes Based on Distorted Gabidulin Codes
- LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
- Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem
- Designing a Rank Metric Based McEliece Cryptosystem
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 4070796 (Why is no real title available?)
- scientific article; zbMATH DE number 177612 (Why is no real title available?)
- scientific article; zbMATH DE number 1302794 (Why is no real title available?)
- scientific article; zbMATH DE number 2009958 (Why is no real title available?)
- scientific article; zbMATH DE number 1759341 (Why is no real title available?)
- A Polynomial-Time Attack on the BBCRS Scheme
- A new rank metric codes based encryption scheme
- An algebraic attack on rank metric code-based cryptosystems
- Attacks and counter-attacks on the GPT public key cryptosystem
- Coding and Cryptography
- Coding and Cryptography
- Decoding supercodes of Gabidulin codes and applications to cryptanalysis
- Designing a Rank Metric Based McEliece Cryptosystem
- 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
- Improved cryptanalysis of rank metric schemes based on Gabidulin codes
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
- 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 edge-independence number and edge-covering number for regular graphs
- On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
- 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
- Reducible rank codes and their applications to cryptography
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Structural cryptanalysis of McEliece schemes with compact keys
- The Magma algebra system. I: The user language
- The security of the Gabidulin public key cryptosystem
- Theory of codes with maximum rank distance
- Weak keys in the McEliece public-key cryptosystem
This page was built for publication: Two modifications for Loidreau's code-based cryptosystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602397)
