RSA is a well-known public-key cryptography algorithm and it is best used for signing as well as encryption. It is considered to be one of the great discovery in public key cryptography. In RSA, 'n' is send via public key, and if 'n's' factors can be found by brute force attack it will increase the vulnerability of the algorithm. In this paper, we describe a new algorithm which is enhancement over RSA algorithm. Here, we are clubbing the modified RSA algorithm with Hill Cipher method, which increases the security. We first encrypt the data with the help of matrix, later the data is again encrypted by the n1 value. The cipher text is sent and at receiver side it get decrypted by the n2 value and again decrypted by the inverse matrix to get the plain text. © Research India Publications.