Paper 2017/236

A new rank metric codes based encryption scheme

Pierre Loidreau

Abstract

We design a new McEliece-like rank metric based encryption scheme from Gabidulin codes. We explain why it is not affected by the invariant subspace attacks also known as Overbeck's attacks. The idea of the design mixes two existing approaches designing rank metric based encryption schemes. For a given security our public-keys are more compact than for the same security in the Hamming metric based settings.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
McEliece encryption schemecode based cryptography
Contact author(s)
Pierre Loidreau @ m4x org
History
2017-03-11: received
Short URL
https://ia.cr/2017/236
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2017/236,
      author = {Pierre Loidreau},
      title = {A new rank metric codes based encryption scheme},
      howpublished = {Cryptology ePrint Archive, Paper 2017/236},
      year = {2017},
      note = {\url{https://eprint.iacr.org/2017/236}},
      url = {https://eprint.iacr.org/2017/236}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.