Analisis Aryabhata Remainder Theorem dalam Kriptografi Rivest Shamir Adleman (RSA)

Abstract

Rivest Shamir Adleman (RSA) is the most widely used crypto systems in security applications. Cryptographic security of RSA lies in the difficulty of factoring numbers p and q to be prime factors. The larger the value of p and q are used, the more secure the key is applied. But this can make the decryption process becomes very slow. A variety of methods to speed up the decryption process has been widely used and one of them is the Chinese Remainder Theorem. In this study, we analyzed Aryabhata Remainder Theorem, a method used to solve problems such as methods of residue number Chinese Remainder Theorem. we compare the RSA decryption process using the method of Aryabhata Remainder Theorem and RSA decryption using the Chinese Remainder Theorem to find a faster method in the RSA decryption process with the large key (the value of p and q).