Matrix Modification of RSA Digital Signature Scheme

Abstract Representation of message in the form of a matrix in place of integers can reduce the key sizes along with the storage space without compromising the security. In this paper we propose modification of RSA digital signature scheme using square matrices of order h × h. Instead of relying on the Euler’s totient function it relies on the exponentiation modulus, which is obtained by the concept of the general linear group of order h.