摘要
现代密码体制中大量运用求大整数的幂这样的运算。现有的求幂算法基本上都是将幂的二进制表示分成小的片断然后进行预计算,根据片断的大小预计算出所有片断可能的值。因此对窗口算法做了扩展,提出根据预计算量来划分段的思想,原来的窗口算法成为新算法的一个特例。同时,对新算法做了理论分析并用测试数据验证了其正确性。
Modern cryptography extremely relies on exponentiation. The existing techniques for exponentiation split exponent＇s binary representation into some small fragments and then precompute all possible value of these fragments. In this paper window algorithm for exponentiation is extanded to a new algorithm. The new algorithm partitions exponent＇s binary representation according to precomputation consumption and window method become a special case of new algorithm. Finally, the correctness of the algorithm＇ s theoretic analysis is validated by testing data.
出处
《微电子学与计算机》
CSCD
北大核心
2007年第8期106-109,112,共5页
Microelectronics & Computer
