International Journal of Engineering and Technology

In asymmetric key cryptography, also known as Public Key cryptography. There are two different keys which are used that form a key pair. One key is used for encryption and the other is used for decryption, therefore, no other key can decrypt the message. The advantage of this scheme is that every communicating party needs just a key pair for communicating with anyone else.
RSA is a well-known public-key cryptography algorithm and it is suitable for signing as well as encryption. Thereby, it was considered one of the first great advances in public key cryptography. In RSA, n is transmitted in public key, and if n’s factors can be found by brute force attack it will reduce the security of the algorithm. In this paper, we describe a new algorithm which is similar to RSA algorithm with some modification. This helps in increasing the security of RSA algorithm. There are two n values: n1 and n2. We have used four variables to determine the value of n1. This make it difficult to factorize n1 value. n1 is used during encryption and n2 is used during decryption.