Implementation of 1024-bit RSA Based on Modified Montgomerys Algorithm

摘要：

In this paper, we proposed an implementation of 1024bit RSA. The modified Montgomery algorithm made the modular multiplication simple using addition and shifting. We introduce four-to-two CSA architecture to design the modified Montgomerys algorithm. It can not convert the carry-save form of an operand into its binary representation at each end of modular multiplication. At the end of RSA, we use the basic 4-CPA to accomplish the data form conversion. As a result, our design can reduce the operating time. This architecture adapts to the single chip for key lengths in excess of 1024-bits of RSA.

关键词： RSA Modified Montgomery four-to-two CSA

作者: Xinggang WANG Yulin ZHANG

作者单位: School of Information Science and Engineering University of Jinan Jinan, China

会议类型: 国际会议

会议名称: 2011 International Conference on Security Science and Technology(ICSST 2011) (2011年安全科学与技术国际会议)

会议地点: 重庆

会议语种:英文

页码: 141-144

在线出版日期: 2011-01-21（万方平台首次上网日期，不代表论文的发表时间）