Implementation and analysis of modifications in RSA algorithm

Abstract

In asymmetric key cryptography, also called public key cryptography, two different keys (which form a
key pair) are used. One key is used for encryption and only the other corresponding key must be used for
decryption. No other key can decrypt the message not even the original (i.e. the first) key used for encryption. The
beauty of this scheme is that every communicating party needs just a key pair for communicating with any
number of other communicating parties. Once someone obtains a key pair, he/she can communicate with anyone
else. “The short range natural number (SRNN) algorithm” is similar to RSA algorithm with some modifications.
This modification increases the security of the cryptosystem. In this algorithm extremely large number has two
prime factors (similar to RSA).Also this Technique two key pair has been used, one small size key pair for data
encryption and one large size key pair to encrypt key component(n=p*q) of small size key pair. This natural
numbers increases the security of cryptosystem. So its name is “Modified RSA public key cryptosystem using two
key pairs”.