The RSA Cryptoprocessor Hardware Implementation Based on Modified Montgomery Algorithm

被引:1
作者
陈波
王旭
戎蒙恬
机构
[1] China
[2] Dept. of Electronic Eng.
[3] Shanghai Jiaotong Univ.
[4] Shanghai 200030
关键词
Montgomery algorithm; modular multiplication; modular exponentiation;
D O I
暂无
中图分类号
TN918.1 [理论];
学科分类号
070104 ;
摘要
RSA(Rivest-Shamir-Adleman)public-key cryptosystem is widely used in the information security area such as encryption and digital signature. Based on the modified Montgomery modular multiplication algorithm, a new architecture using CSA(carry save adder)was presented to implement modular multiplication. Compared with the popular modular multiplication algorithms using two CSA, the presented algorithm uses only one CSA, so it can improve the time efficiency of RSA cryptoprocessor and save about half of hardware resources for modular multiplication. With the increase of encryption data size n, the clock cycles for the encryption procedure reduce in (T(n~2),) compared with the modular multiplication algorithms using two CSA.
引用
收藏
页码:107 / 111
页数:5
相关论文
empty
未找到相关数据