PARALLEL COMPUTATION OF THE MULTI-EXPONENTIATION FOR CRYPTOSYSTEMS

Some methods of fast modular exponentiation have been proposed in the past years. However, there are only a few parallel mechanisms for eval uating the modular multi-exponentiation. In this paper, we propose two efficient parallel algorithms to speed up the computation of the modu lar multi-exponentiation Pi(i=1)(n) M(i)(Ei) (mod N), which is an impo rtant but time-consuming arithmetic operation used in many scientific researches and applications, especially in the contemporary cryptosyst ems. We also show that our two proposed methods are faster than the be st known sequential method (the Shamir's method) and parallel method ( the Chiou's method). Furthermore, our methods can be implemented easil y in the multicomputer systems.