RSA模程加密处理器.pdf

第36 卷 第13 期 计 算 机 工 程 2010 年7 月 ol Computer Engineering July 2010 V .36 No.13 ·安全技术· 文章编号：1000—3428(2010)13—0125—03 文献标识码：A 中图分类号：TP309.2 基于Montgomery 模乘的RSA 加密处理器 薛 念，潘 赟，张宇弘，严晓浪 (浙江大学超大规模集成电路设计研究所，杭州 310027) 摘 要：提出一种基4 的Montgomery 模乘算法及优化的硬件结构，将传统基2 模乘运算迭代次数减少近一半。在该模乘模块基础上设计 高速RSA 加密处理器，采用进位保留形式的全并行模幂运算流程，避免长进位链和中间结果转换的问题。结果表明，该设计同时适应FPGA 和ASIC 实现，完成一次标准1 024 位RSA 加密运算仅需9 836 个周期，加密速率提高50%以上。 关键词：RSA 加密；模乘；模幂；蒙哥马利；进位保留加法器 RSA Encryption Processor Based on Montgomery Modular Multiplication XUE Nian, PAN Yun, ZHANG Yu-hong, YAN Xiao-lang (Institue of VLSI Design, Zhejiang University, Hangzhou 310027) 【Abstract 】A radix-4 Montgomery modular multiplication and the optimized circuit architecture are presented. It can reduce iterations of traditional radix-2 modular multiplication to about 50%. Based on this module, the implementation of high speed RSA encryption processor follows completely parallel modular exponentiation flow with Carry Save Addition(CSA) structure to perform long integer arithmetic. This avoids the repeated interim output/output format conversion. Result shows that the optimization is technology independent and thus should suit well for not only FPGA implementation but also ASIC. This design can complete a standard 1 024 bit RSA encrypt operation with only 9 836 clock cycles. Compared to the recently proposed design in the literature, the proposed design can achieve an increase of over 50% in throughput. 【Key words 】RSA encryption; modular multiplication; modular exponentiation; Montgomery; Carry Save Ad