Ideals over a Non-Commutative Ring and their Application in Cryptology
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.
KeywordsGenerator Matrix Left Ideal Cyclic Shift Rank Distance Goppa Code
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar