Study on Several Fast Algorithm of Modular Exponentiation in RSA

摘要

This paper discusses several fast algorithms of modular exponentiation in RSA. Experiment results show that the third and fourth algorithm presented are more efficient, but the third algorithm is more suitable for distributed computing environment such as Internet/Intranet, while the fourth algorithm in this paper can get significant efficiency using single computer.