Secure RSA Variant System to Avoid Factorization Attack using Phony Modules and Phony Public Key Exponent
Raghunandan K R1, Ganesh Aithal2, Surendra Shetty3
1Raghunandan K R, Department of Computer Science Engineering, NMAM Institute of Technology, Nitte, Affiliated to VTU, Karkala, Udupi, Karnataka, India.
2Ganesh Aithal, Department of Computer Science Engineering, MITE, Moodabidre, Affiliated to VTU, Karnataka, India.
3Surendra Shetty, Department of MCA, NMAM Institute of Technology, Nitte Affiliated to VTU, Karkala, Udupi, Karnataka, India.
Manuscript received on 30 June 2019 | Revised Manuscript received on 05 July 2019 | Manuscript published on 30 July 2019 | PP: 1065-1070 | Volume-8 Issue-9, July 2019 | Retrieval Number: I7807078919/19©BEIESP | DOI: 10.35940/ijitee.I7807.078919

Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: 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.
Index Terms: Euler’s Function, Fermat Factorization, Public Key Cryptography, Wieners Attack.

Scope of the Article: Secure Mobile and Multi-Agent Systems