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.
Cite
CITATION STYLE
Loidreau, P. (2017). A new rank metric codes based encryption scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10346 LNCS, pp. 3–17). Springer Verlag. https://doi.org/10.1007/978-3-319-59879-6_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
