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. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Loidreau, P. (2010). Designing a rank metric based McEliece cryptosystem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6061 LNCS, pp. 142–152). Springer Verlag. https://doi.org/10.1007/978-3-642-12929-2_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
