| 一种新型操作数长度可伸缩的模乘器VLSI设计 |
| |
| 引用本文： | 顾叶华,曾晓洋,赵佳,陆荣华.一种新型操作数长度可伸缩的模乘器VLSI设计[J].计算机工程,2007,33(19):227-229. |
| |
| 作者姓名： | 顾叶华 曾晓洋 赵佳 陆荣华 |
| |
| 作者单位： | 复旦大学专用集成电路与系统国家重点实验室,上海,201203 |
| |
| 基金项目： | 国家自然科学基金
,
上海市科委资助项目 |
| |
| 摘 要： | 在改进基于字的Montgomery模乘算法的基础上，通过优化流水线结构缩短关键路径，实现了一种结构优化的模乘器。设计中采用了按字运算的高基Montgomery模乘算法，使该设计具有良好的可扩展性，可以完成任意位数的模乘运算。改进了模乘器的流水线结构，提高了模乘器的工作效率。该设计可以应用于各种高性能且低成本的RSA密码协处理器设计。
|
| 关 键 词： | RSA Montgomery模乘算法 流水线 可伸缩 VLSI |
| 文章编号： | 1000-3428（2007）19-0227-03 |
| 修稿时间： | 2006-10-10 |
VLSI Design of New Operand Scalable Modular Multiplier |
| |
| GU Ye-hua,ZENG Xiao-yang,ZHAO Jia,LU Rong-hua.VLSI Design of New Operand Scalable Modular Multiplier[J].Computer Engineering,2007,33(19):227-229. |
| |
| Authors: | GU Ye-hua ZENG Xiao-yang ZHAO Jia LU Rong-hua |
| |
| Affiliation: | State Key Lab of ASIC and System,Fudan University,Shanghai 201203 |
| |
| Abstract: | This paper proposes a modified multiple-word radix-2k Montgomery multiplication(MWR2kMM) algorithm with its corresponding VLSI architecture.With the adoption of MWR2kMM algorithm,the proposed multiplier is able to work with any precision of the input operands and has a shorter critical path.Meanwhile,its performance is much higher compared with previous work because of the optimization of the pipeline architecture.The proposed multiplier is very suitable to the low cost and high performance RSA cryptosystem and can be easily implemented in VLSI technology. |
| |
| Keywords: | RSA Montgomery multiplication pipeline scalable VLSI |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
