Fast public key cryptosystem based on matrix rings
BS Adiga, Priti Shankar · Electronics Letters · 1986
A public key cryptosystem is proposed, which is based on the assumption that finding the square root of an element in a large finite ring is computationally infeasible in the absence of a knowledge of the ring structure. The encryption and decryption operations are very fast, and the data expansion is 1:2.