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.

The only known construction of error-correcting codes in rank metric was proposed in 1985 [1]. These were codes with fast decoding algorithm. We present a new construction of rank codes, which defines new codes and includes known codes. This is a generalization of [1]. Though the new codes seem to be very similar to subcodes of known rank codes, we argue that these are different codes. A fast decoding algorithm is described.

No abstract

No abstract

No abstract