Paper 2017/236 Original: eprint.iacr.org/2017/236 ↗
A new rank metric codes based encryption scheme
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.
- History
- 2017-03-11: last updated
- 2017-03-11: published
- Short URL
- https://ia.cr/2017/236
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2017/236}
}