| 基于Montgomery模乘的RSA算法VLSI实现 |
| |
| 引用本文： | 江隽文,周玉洁.基于Montgomery模乘的RSA算法VLSI实现[J].信息技术,2006,30(4):85-89. |
| |
| 作者姓名： | 江隽文 周玉洁 |
| |
| 作者单位： | 上海交通大学信息安全学院,上海,200030 |
| |
| 摘 要： | 介绍了一种基于可伸展的Montgomery模乘结构的1024位RSA加解密芯片实现。设计采用的新型心动阵列结构，可以有在有效控制芯片面积的前提下，极大地提高运算频率，从而提高运算速度。经过ModelSim仿真和Design Compiler综合，与当前已发表的RSA芯片设计相比，该设计在面积和速度上均有优势。
|
| 关 键 词： | 模乘 心动阵列 模幂 |
| 文章编号： | 1009-2552(2006)04-0085-04 |
| 修稿时间： | 2005年10月18 |
VLSI implementation for RSA algorithm based on Montgomery modular multiplication |
| |
| JIANG Jun-wen,ZHOU Yu-jie.VLSI implementation for RSA algorithm based on Montgomery modular multiplication[J].Information Technology,2006,30(4):85-89. |
| |
| Authors: | JIANG Jun-wen ZHOU Yu-jie |
| |
| Abstract: | In this paper a 1024-bits RSA encryption chip based on scalable montgomery modular multiplier is proposed.It adopts a new systolic array architecture, which can improve the speed by increasing the frequency without the size increased.This design has been simulated by ModelSim and synthesized by Design Compiler.Compared with other RSA IC designs,the design has the advantage of small size and high speed. |
| |
| Keywords: | RSA Montgomery |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
