摘要
针对大数模乘算法的滑动窗口实现中移位次数较多,提出了一种适应芯片实现的快速循环移位实现方法。通过将大数乘法运算转换为查找表和加法运算,并减少进位的判断和增加每次循环移位的距离来减少加法次数和移位次数。使得完成一次大数模乘运算的时间随着移位窗口的增加而减少。
As the number of shift is more in the implementation of sliding window for the large number modular multiplication algorithm, this paper presents rapid circle-shift method in chip. Firstly, the large numbers multiplication is transforming into a look-up table and addition operations; secondly, the number of addition and shift is reduced by reducing the carry judgments and increasing the width of one circle-shift. The time of the large number modular multiplication is decreasing with the increasing width of shift window.
出处
《武汉理工大学学报》
CAS
CSCD
北大核心
2009年第23期108-112,共5页
Journal of Wuhan University of Technology
基金
"十一五"国防重点预言项目(513160201)
关键词
模乘
循环移位
滑动窗口
加法器
modular multiplication
circle-shift
sliding window
adder
