Analysis Aryabhata Remainder Theorem On Rivest Shamir Adleman (RSA) Cryptography
| Main Authors: | Hariyanto, Eko Hariyanto, Zarlis, Muhammad, Nasution, Darmeli Nasution, Wahyuni, Sri |
|---|---|
| Format: | Article info application/pdf |
| Bahasa: | eng |
| Terbitan: |
IAIC Publisher
, 2020
|
| Subjects: | |
| Online Access: |
https://aptikom-journal.id/index.php/csit/article/view/183 https://aptikom-journal.id/index.php/csit/article/view/183/96 |
Daftar Isi:
- Security of RSA cryptography lied in the difficulty of factoring the number p and q bacame the prime factor. The greater the value of p and q used, the better the security level was. However, this could result in a very slow decryption process. The most commonly used and discussed method of speeding up the encryption and decryption process in RSA was the Chinese Remainder Theorem (CRT). Beside that method, there was another method with the same concept with CRT namely Aryabhata Remainder Theorem which was also relevant used in public key cryptography such as RSA. The purpose of this study was to obtain an effective method to RSA especially in the decryption process based on the calculation of the time complexity of computing.