Secure RSA Variant System to Avoid Factorization Attack using Phony Modules and Phony Public Key Exponent

In cryptography Public key cryptography plays a significant job in the field of data communication. Public key uses two distinctive keys where keys are related so those, the public key can use to encode the information and private key is utilized to decode. RSA is considered as one of the effective algorithm in public key cryptography. Effectiveness of RSA Algorithm for the most part relies upon how adequately public key segments is shared i.e. common modulus n and public key exponent e. If these components compromised by the hacker using mathematical attacks, acquiring private key becomes easier task for the intruder. This paper present an upgraded RSA algorithm which is used to avoid the limitations of Integer factorization attack by improving the complexity of factorization process by utilizing fake/phony public key exponent type f rather than e and phony modulus X rather than n. Paper also gives comparative analysis of the proposed work using standard metrics.