The deduction of the accelerated formula and the efficiency estimating in a number of primes in RSA decryption algorithm with Chinese remainder theorem
Zhenxiang Gao · Dalian Gongye Daxue xuebao · 2012
RSA algorithms play an important role in the public key cryptography.Its computational efficiency have an immediately correlation with the efficiency of modular exponentiation implementation.In this paper the general formula for multiple primes of RSA algorithm were given by reducing the number of modular exponentiation,recover the original simply and fast.A formula for estimating efficiency also was given to calculate the efficiency of acceleration by estimating,which can provide the basis for the most appropriate numbers for RSA.