Corpus ID: 54476057

On a Rank-Metric Code-Based Cryptosystem with Small Key Size

@article{Renner2018OnAR,
  title={On a Rank-Metric Code-Based Cryptosystem with Small Key Size},
  author={Julian Renner and S. Puchinger and A. Wachter-Zeh},
  journal={ArXiv},
  year={2018},
  volume={abs/1812.04892}
}
A repair of the Faure-Loidreau (FL) public-key code-based cryptosystem is proposed. The FL cryptosystem is based on the hardness of list decoding Gabidulin codes which are special rank-metric codes. We prove that the recent structural attack on the system by Gaborit et al. is equivalent to decoding an interleaved Gabidulin code. Since all known polynomial-time decoders for these codes fail for a large constructive class of error patterns, we are able to construct public keys that resist the… Expand
Decoding High-Order Interleaved Rank-Metric Codes

References

SHOWING 1-10 OF 33 REFERENCES
Repairing the Faure-Loidreau Public-Key Cryptosystem
Key reduction of McEliece's cryptosystem using list decoding
  • M. Barbier, P. Barreto
  • Computer Science, Mathematics
  • 2011 IEEE International Symposium on Information Theory Proceedings
  • 2011
Reducible rank codes and their applications to cryptography
Polynomial-time key recovery attack on the Faure–Loidreau scheme based on Gabidulin codes
A New Public-Key Cryptosystem Based on the Problem of Reconstructing p-Polynomials
Low Rank Parity Check codes and their application to cryptography
A New Rank Metric Codes Based Encryption Scheme
MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes
Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius
Public key cryptography based on coding theory
...
1
2
3
4
...