新的无符号滑动窗口算法及其在模幂中的应用研究

Efficient unsigned sliding window algorithm based on run-length for modular exponentiation

对固定窗口算法与滑动窗口算法进行了有效的分析和对比,提出了一种基于游程的无符号滑动窗口算法。新算法相比其他无符号滑动窗口算法更能有效地提高模幂运算的效率,特别对游程分布较好的指数E,效果更明显。该算法可以较好地应用于RSA和ECC等公钥密码系统的加解密及认证运算中。

After contrastive analysis of the constant window algorithm and sliding window algorithm, an efficient unsigned sliding window algorithm was presented based on run-length for modular expo- nentiation. Results of experiment and performance show that the new algorithm is efficient for impro- ving the speed of RSA. It can be applied well in encryption, decryption and authentication with RSA and ECC.