动态组合RSA算法

Dynamic combined RSA algorithm

大整数模幂乘运算一直是制约RSA广泛应用的瓶颈,研究该课题具有重要的实际意义。提出了一种新的动态组合RSA算法。该算法在运用SMM算法和2进制算法的基础上,结合模n和可变底数a对指数m动态取最优的幂后进行模幂乘运算。理论分析和试验证明新算法的最优时间复杂度可达到O(ln2)。

Modular exponentiation of large integers is the bottleneck for RSA, so it is important to take research on this issue. A new fast dynamic combined modular exponentiation multiplication is presented. On the basis of SMM and 2k algorithms, the optimal exponential dynamically is gotten according to module and radix before the module. Theoretical analysis and experiment results show that the best time complexity of the new algorithm reduces to O （ln^2n）.