Two modifications for Loidreau's code-based cryptosystem

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Structural cryptanalysis of McEliece schemes with compact keys
Enhanced public key security for the McEliece cryptosystem
Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
Attacks and counter-attacks on the GPT public key cryptosystem
Theory of codes with maximum rank distance
The Magma algebra system. I: The user language
Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes
Improved cryptanalysis of rank metric schemes based on Gabidulin codes
A new rank metric codes based encryption scheme
Extension of Overbeck's attack for Gabidulin-based cryptosystems
New technique for decoding codes in the rank metric and its cryptography applications
LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
An algebraic attack on rank metric code-based cryptosystems
Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem
Decoding supercodes of Gabidulin codes and applications to cryptanalysis
On the security of a Loidreau rank metric code based encryption scheme
New criteria for MRD and Gabidulin codes and some rank-metric code constructions
Structural attacks for public key cryptosystems based on Gabidulin codes
Improvements of algebraic attacks for solving the rank decoding and MinRank problems
The Security of the Gabidulin Public Key Cryptosystem
A Polynomial-Time Attack on the BBCRS Scheme
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
On the inherent intractability of certain coding problems (Corresp.)
On the edge-independence number and edge-covering number for regular graphs
On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
Weak keys in the McEliece public-key cryptosystem
Coding and Cryptography
Coding and Cryptography

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)