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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
E. M. Gabidulin, “Theory of Codes with Maximum Rank Distance”, Problems of Information Transmission, vol. 21, no. 1, pp. 1–12, July, 1985 (Russian Original, January–March, 1985).
R. J. McEliece, “A Public-Key Cryptosystem Based on Algebraic Coding Theory”, pp. 114–116 in DSN Progress Report 42-44, Jet Propulsion Lab., Pasadena, CA, January–February, 1978.
E. R. Berlekamp, R. J. McEliece and H. C. A. van Tilborg, “On the Inherent Intractability of Certain Coding Problems”, IEEE Trans. Inf. Th., vol. IT-24, pp. 384–386, May 1978.
C. M. Adams and H. Meijer, “Security-Related Comments Regarding McEliece’s Public-Key Cryptosystem”, pp. 224–228 in Advances in Cryptology—CRYPTO’ 87 (Ed. C. Pomerance), Lecture Notes in Computer Sci. No. 293. Heidelberg and New York: Springer-Verlag, 1988.
P. J. Lee and E. F. Brickell, “An Observation on the Security of the McEliece Public-Key Cryptosystem”, pp. 275–280 in Advances in Cryptology—EUROCRYPT’ 88 (Ed. C. Günther), Lecture Notes in Computer Sci. No. 330. Heidelberg and New York: Springer-Verlag, 1988.
U. M. Maurer and J. L. Massey, “Perfect Local Randomness in Pseudo-Random Sequences, pp. 100–112 in Advances in Cryptology—CRYPTO’ 89 (Ed. G. Brassard), Lecture Notes in Computer Sci. No. 435. Heidelberg and New York: Springer-Verlag, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V. (1991). Ideals over a Non-Commutative Ring and their Application in Cryptology. In: Davies, D.W. (eds) Advances in Cryptology — EUROCRYPT ’91. EUROCRYPT 1991. Lecture Notes in Computer Science, vol 547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46416-6_41
Download citation
DOI: https://doi.org/10.1007/3-540-46416-6_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54620-7
Online ISBN: 978-3-540-46416-7
eBook Packages: Springer Book Archive