RSA Decryption Techniques and the Underlying Mathematical Concepts
Hailiza Kamarul Haili, Norfadhilah Basir · 2009
Number theory is always known for its practicality in many fields. One of the most interesting applications of it is in the study of RSA cryptosystem and this is in fact one of the famous and widely used public key cryptosystem. The implementation of RSA cryptosystem based its security on concepts in number theory. Even though RSA cryptosystem has developed more than two decades, but it is still now a hot research topic. In this paper we discuss decryption techniques in RSA cryptosystem that based its operation on the Chinese Remainder Theorem. We will show that this approach can speed up the decryption process and it can reduce the computational cost compared to the traditional method. Comparisons were done on three different types of operations, the traditional method, the Chinese Remainder Theorem method and the Chinese Remainder Theorem method with added strong prime criterion. We will also discuss a few fast decryption methods as well as an efficient decryption method.