Enhancing security features in RSA cryptosystem

The public key cryptosystem RSA is considered to be the first algorithm for public key encryption and decryption method for saving data confidentially over the network. However, several successful attacks are developed to break this algorithm due to certain limitations assumed in its derivation. The algorithm´s security is primarily based on the problem of factoring large number. If the process factorization is done then the whole algorithm can become breakable. This paper presents a methodology to change the original modulus (product of two prime numbers). The changed modulus value will be publicly announced which might be the fake value. Even if the hacker factorizes this new modulus value, he can´t be searched out the original decryption key (d). Inability to find the original decryption key, the factorization is worthless. This scheme helps to overcome the weaknesses of factorization found in RSA.