Analytical Comparison Of RSA And RSA With Chinese Remainder Theorem

• Published in: Journal of independent studies and research computing 2016-07, Vol.14 (1)
• Main Authors: Mantri, Ankur, Razaque, Abdul, Makwana, Hiral, Parekh, Parita, Soomro, Tariq Rahim
• Format: Article
• Language: English
• Subjects: CRT; Decryption; RSA
• ISSN: 2412-0448; 1998-4154
• DOI: 10.31645/jisrc/(2016).14.1.0003

RSA encryption algorithm is one of the most powerful public key encryption algorithm. The problem with RSA algorithm is that RSA decryption is relatively slow in comparison to RSA encryption. Chinese Remainder Theorem (CRT), a modulo based mathematical theorem, is proposed by researchers as a way to enhance the performance of decryption. CRT minimizes the mathematical computation to large extent, thus improving the speed. CRT is well known for improving RSA’s decryption speed, but it has some drawbacks which limits its usage. The problem is that the limitations or drawbacks of CRT are not highlighted. The goal of this research paper is to address disadvantages of CRT when used for RSA decryption. Apart from the social and economic impacts, this paper covers the effects of research on current cryptographic protocols used by different browsers as well as organizations. In order to achieve goal, we are comparing several factors between RSA decryption with RSA-CRT decryption. We are using JAVA programming language to analyze the decryption algorithms. The significance of this research paper is to serve as the foundation for further research on RSA-CRT decryption. In addition, this paper addresses situations where CRT decryption is faster and beneficial to use by stating its advantages and disadvantages.