Extension of rsa cryptosystems to matrix rings

V. Varadharajan, R. Odoni

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


A generalization of the RSA cryptosystem in the ring of matrices over Z/mZ is presented. It is shown that factorization of the modulus m is needed to compute the exponent of the group formed by either non-singular matrix messages or upper triangular matrices including diagonal elements thus offering the same level of security as the RSA system. The latter method employing the triangular matrices as messages seems to be more practical than the use of arbitrary non-singular matrix messages. The scheme is as suitable for privacy and authentication as its predecessor.

Original languageEnglish
Pages (from-to)140-153
Number of pages14
Issue number2
Publication statusPublished - 1985
Externally publishedYes


Dive into the research topics of 'Extension of rsa cryptosystems to matrix rings'. Together they form a unique fingerprint.

Cite this