Abstract
A new modification of the McEliece public-key cryptosystem is proposed that employs the so-called maximum-rank-distance (MRD) codes in place of Goppa codes and that hides the generator matrix of the MRD code by addition of a randomly-chosen matrix. A short review of the mathematical background required for the construction of MRD codes is given. The cryptanalytic work function for the modified McEliece system is shown to be much greater than that of the original system. Extensions of the rank metric are also considered.
Cite
CITATION STYLE
Gabidulin, E. M., Paramonov, A. V., & Tretjakov, O. V. (1991). Ideals over a non-commutative ring and their application in cryptology. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 547 LNCS, pp. 482–489). Springer Verlag. https://doi.org/10.1007/3-540-46416-6_41
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
