Modified Key Generation in RSA Algorithm
Carlo A. Intila1, Bobby D. Gerardo2, Ruji P. Medina3 

1Carlo A. Intila, Department Information Technology from the Technological Institute of the Philippines in Quezon City, Philippines
2Bobby Gerardo, Department Administration and Finance at the West Visayas State University.
3Ruji P. Medina, Department of the Technological Institute of the Philippines in Quezon City, Philippines.

Manuscript received on 13 March 2019 | Revised Manuscript received on 17 March 2019 | Manuscript published on 30 July 2019 | PP: 5311-5315 | Volume-8 Issue-2, July 2019 | Retrieval Number: B1012078219/19©BEIESP | DOI: 10.35940/ijrte.B1012.078219
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: RSA Algorithm is one of the widely used asymmetric cryptography. But with several conducts of the different studies, factorization attack based on the value of modulo ‘n’ and based on the public key, the value of the private key is vulnerable. With this, the study modified the RSA Algorithm based on modulo and the public key. The modulo transformed into a new value that produced a compound result in the factorization process. At the same time, the public key has been modified by choosing randomly from collected values and transformed to a different value making it a better-hidden private key. The two algorithms compared in terms of factorization, encryption and decryption, and speed. The modification of the RSA Algorithm based on modulo and public key produced a new two-tier scheme in terms of factorization, and encryption and decryption process. The new scheme in the result is resistant to factorization and has a new scheme of private key hiding.
Index Terms: Key Generation, Modulo, Private Key, Public Key, RSA Algorithm.
Scope of the Article: Next Generation Internet & Web Architectures