Adiga, BS and Shankar, P (1986) Fast Public Key Cryptosystem Based On Matrix Rings. In: Electronics Letters, 22 (22). pp. 1182-1183.
getPDF.pdf - Published Version
Restricted to Registered users only
Download (297Kb) | Request a copy
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:||Journal Article|
|Additional Information:||Copyright of this article belongs to The Institution of Electrical Engineers.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||20 Jul 2009 11:48|
|Last Modified:||29 Feb 2012 07:28|
Actions (login required)