Post-Quantum Cryptography

Volume 6061 of the series Lecture Notes in Computer Science pp 142-152

Designing a Rank Metric Based McEliece Cryptosystem

  • Pierre LoidreauAffiliated withDGA and IRMAR, Université de Rennes 1

* Final gross prices may vary according to local VAT.

Get Access


In this paper we describe the rank metric based McEliece type cryptosystems which where first introduced by Gabidulin, Paramonov and Tretjakov in the 90’s. Then we explain the principle of Overbeck’s attack is so efficient on these types of systems. Finally we show how to choose the parameters so that the public-key size remain relatively small (typically less than 20 000 bits), with a good security against structural and decoding attacks.