Fast decryption method for a Rabin primitive-based cryptosystem

• Main Authors: Asbullah, Muhammad Asyraf, Kamel Ariffin, Muhammad Rezal
• Format: Article
• Language: English
• Published: Advanced Institute of Convergence Information Technology 2014
• Online Access: http://psasir.upm.edu.my/id/eprint/37655/1/Fast%20decryption%20method%20for%20a%20Rabin%20primitive-based%20cryptosystem.pdf; http://psasir.upm.edu.my/id/eprint/37655/; http://www.aicit.org/dl/citation.html?id=IJACT-3444

The Chinese Remainder Theorem (CRT) is an algorithm for solving linear congruence system into a unique representation and has been a useful tool in applications of cryptography. For real-world practicality, Garner’s algorithm is efficient to speed up the CRT computation. Recently, a cryptosystem based on the Rabin primitive was designed which utilizing the CRT for its decryption routine. It seems that its current decryption algorithm is significantly slower than its encryption process. Hence faster decryption algorithms are sought-after. In this paper we design a fast and efficient algorithm for the decryption of the new cryptosystem based on the Rabin primitive. We then review and analyze the usefulness of the Garner’s algorithm in our proposed method. Our results indicate that the asymptotic complexity of the proposed algorithm indeed reduced the computational cost of the decryption process. We also provide the empirical results on the running time using the single-precision multiplications measurement. The results prove that our design reduces the cost of the current algorithm by approximately 33.8%.