摘要： 传统的算法是对指数m二进制化后进行重复平方运算。文章给出一种新的RSA的快速算法，结合模n和底数a对指数m动态地取最优的幂后进行模幂乘运算，时间复杂性分析表明新算法可以减少加密和解密的计算量。

关键词: RSA, 算法, 时间复杂性

Abstract: This paper gives out a new fast RSA algorithm, before the modular exponentiation it gets the optimal exponential dynamically according to module and base number. It is shown by time complexity that the new algorithm obtains the speed improvement of encryption and decryption compared with the modular exponentiation by the repeated squaring method.

中图分类号: 

• TP393.08