Analysis of RSA variants in securing message

Nadia Widari Nasution, Syahril Efendi, Sawaluddin Sawaluddin · IOP Conference Series Materials Science and Engineering · 2020

Abstract Message security is an important thing to prevent the interference from third parties. RSA cryptographic algorithm is believed to be a powerful algorithm in securing message. However, RSA computing process takes a long time so it takes several variants of RSA, namely R prime RSA and Multi-factor RSA which can reduce time and computing cost on the encryption and decryption side. In this paper, the author use three prime numbers to improve better security than only use two prime numbers and minimize the value of private key “d” is by using Chinese Reminder Theorm (CRT).

Read the paper · More papers on PaperTik