Matrix Extensions of the RSA Algorithm

Authors:
Chih-Chwen Chuang;James G. Dunham
Affiliations:
-;-
Venue:
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Year:
1990

Citing 3
Cited 0

RSA chips (past/present/future)

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Strong primes are easy to find

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new matrix extension of the RSA algorithm is proposed which is based on the Cayley-Hamilton theorem and a one-way function. The security of this algorithm rests upon both that of the RSA algorithm and the one-way function. The computational efficiency of the new algorithm depends on the dimension of the matrix. The most efficient implementation is the 2脳2 case in which both encryption and decryption use a single modulo arithmetic multiplication and single evaluation of the one-way function.