Fast public key cryptosystem based on matrix rings

Adiga, BS and Shankar, P (1986) Fast public key cryptosystem based on matrix rings. Electronics Letters, 22. pp. 1182-1183.

Full text not available from this repository.


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.

Item Type: Article
Additional Information: Copyright for this article belongs to IEE
Uncontrolled Keywords: Information Theory;Mathematical techniques;Public key cryptosystem;Ring Structure;Cryptography
Subjects: ENGINEERING > Engineering (General)
Depositing User: Ms. Alphones Mary
Date Deposited: 27 Jan 2006
Last Modified: 24 May 2010 04:08

Actions (login required)

View Item View Item