作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (22): 224-226. doi: 10.3969/j.issn.1000-3428.2009.22.077

• 工程应用技术与实现 • 上一篇    下一篇

基于Montgomery的RSA高速低成本实现

王 辉,刘宏伟,张慧敏   

  1. (北京科技大学信息工程学院,北京 100083)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-11-20 发布日期:2009-11-20

High Speed and Low Cost Realization of RSA Based on Montgomery

WANG Hui, LIU Hong-wei, ZHANG Hui-min   

  1. (School of Information Engineering, University of Science & Technology Beijing, Beijing 100083)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-11-20 Published:2009-11-20

摘要: 给出一种支持多种位数RSA算法加密芯片的完整设计方案。采用改进的Montgomery模乘算法和LR模幂算法,根据大数运算的特点和降低资源消耗的需要改进主要运算电路的结构,并采用全定制IC的设计流程进行实现。实验结果表明,该方案结构简单,节省了面积,且能达到较高的性能。

关键词: RSA算法, 模乘, 模幂, 进位保留加法器, Booth编码, 超前进位加法器

Abstract: This paper proposes displays a complete chip design for multiple-digit RSA encryption algorithm. This design uses improved Montgomery modular multiplication algorithm and LR modular exponentiation algorithm. According to the characteristics of computing of large numbers and the need of reducing consumption of resources, this design improves the main operation circuit structure by using full-customed IC design process to realize. Experimental results show that the structure design is simple to realize and can save space and achieve high performance.

Key words: RSA algorithm, modular multiplication, modular exponentiation, Carry Save Adder(CSA), Booth encoding, Carry Look-ahead Adder (CLA)

中图分类号: