Fast Public Key Cryptosystem Based On Matrix Rings
| Data(s) |
23/10/1986
|
|---|---|
| Resumo |
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. |
| Formato |
application/pdf |
| Identificador |
http://eprints.iisc.ernet.in/20675/1/getPDF.pdf Adiga, BS and Shankar, P (1986) Fast Public Key Cryptosystem Based On Matrix Rings. In: Electronics Letters, 22 (22). pp. 1182-1183. |
| Publicador |
The Institution of Electrical Engineers |
| Relação |
http://digital-library.theiet.org/getabs/servlet/GetabsServlet?prog=normal&id=ELLEAK000022000022001182000001&idtype=cvips&gifs=yes&ref=no http://eprints.iisc.ernet.in/20675/ |
| Palavras-Chave | #Computer Science & Automation (Formerly, School of Automation) |
| Tipo |
Journal Article PeerReviewed |
