The Optimal Equations with Chinese Remainder Theorem for RSA’s Decryption Process

Abstract

This research was designed to provide an idea for choosing the best two equations that can be used to finish the RSA decryption process. In general, the four strategies suggested to accelerate this procedure are competitors. Chinese Remainder Theorem (CRT) is among four rivals. The remains are improved algorithms that have been adjusted from CRT. In truth, the primary building block of these algorithms is CRT, but the sub exponent of CRT is substituted with the new value. Assuming the modulus is obtained by multiplying two prime numbers, two modular exponentiations must be performed prior to combining the results. Three factors are chosen to determine the optimal equation: modular multiplications, modular squares, and modular inverses. In general, the proposed method is always the winner since the optimal equation is selected from among four methods. The testing findings show that the proposed technique is consistently 10-30% faster than CRT.