Dynamic combined RSA algorithm
Yang Hua-ling · Jisuanji gongcheng yu sheji · 2006
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 2 algorithms,the optimal expo-nential 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(ln2).