Modified multi prime RSA cryptosystem

• Main Authors: Kamardan, M. Ghazali, Aminudin, N., Che-Him, Norziha, Sufahani, Suliadi, Khalid, Kamil, Roslan, Rozaini
• Format: Conference or Workshop Item
• Language: English
• Published: 2018
• Subjects: T Technology (General)
• Online Access: http://eprints.uthm.edu.my/7011/1/P10113_3bdf5ce22e55537e0d65153f89bdfaf5.pdf; http://eprints.uthm.edu.my/7011/; https://doi.org/10.1088/1742-6596/995/1/012030
• Institution: Universiti Tun Hussein Onn Malaysia

RSA [1] is one of the mostly used cryptosystem in securing data and information. Though, it has been recently discovered that RSA has some weaknesses and in advance technology, RSA is believed to be inefficient especially when it comes to decryption. Thus, a new algorithm called Multi prime RSA, an extended version of the standard RSA is studied. Then, a modification is made to the Multi prime RSA where another keys is shared secretly between the receiver and the sender to increase the securerity. As in RSA, the methodology used for modified Multi-prime RSA also consists of three phases; 1. Key Generation in which the secret and public keys are generated and published. In this phase, the secrecy is improved by adding more prime numbers and addition of secret keys. 2. Encryption of the message using the public and secret keys given. 3. Decryption of the secret message using the secret key generated. For the decryption phase, a method called Chinese Remainder Theorem is used which helps to fasten the computation. Since Multi prime RSA use more than two prime numbers, the algorithm is more efficient and secure when compared to the standard RSA. Furthermore, in modified Multi prime RSA another secret key is introduced to increase the obstacle to the attacker. Therefore, it is strongly believed that this new algorithm is better and can be an alternative to the RSA.