Designing a Rank Metric Based McEliece Cryptosystem

  • Pierre Loidreau
Conference paper

DOI: 10.1007/978-3-642-12929-2_11

Volume 6061 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Loidreau P. (2010) Designing a Rank Metric Based McEliece Cryptosystem. In: Sendrier N. (eds) Post-Quantum Cryptography. PQCrypto 2010. Lecture Notes in Computer Science, vol 6061. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Pierre Loidreau
    • 1
  1. 1.DGA and IRMARUniversité de Rennes 1