Open AccessOn using Aryabhatta Remainder Theorem to Decrypt a Message with RPrime and Rebalanced RSA
Author(s) -
Ch J.L. Padmaja,
V. S. Bhagavan,
B Srinivas
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i2.7.10940
Subject(s) - chinese remainder theorem , remainder , cryptosystem , computer science , arithmetic , encryption , discrete mathematics , mathematics , algorithm , computer network
RSA is the most world widely used asymmetric cryptosystem for network transactions. Through this article, we propose a new implementation of Aryabhatta Remainder theorem (ART) in place of the existing Chinese Remainder Theorem (CRT) to solve congruencies in the decryption phase for the faster variants of RSA such as RPrime RSA and Rebalanced RSA. Through our observations, we prove that using ART for CRT has improved the overall decryption speed of RPrime and Rebalanced RSA.