On an efficient RSA public key encryption scheme

RSA is the most widely used public key scheme for secure communication. Aboud et.al [1], proposed an improved version of original RSA scheme. They generalized it so that it can be implemented in the general linear group on the ring of integers mod n. In the proposed scheme the original message and the encrypted message are h×h square matrices with entries in Zn as against the original RSA scheme which involves integer values. However, we identified a shortcoming of that scheme and proposed a new and efficient RSA public key encryption scheme. We also propose a digital signature scheme based on the new scheme.