| 一种适于硬件实现的快速模乘算法 |
| |
| 引用本文： | 庞珊娜,樊晓桠,李涛.一种适于硬件实现的快速模乘算法[J].计算机工程与应用,2003,39(31):107-108. |
| |
| 作者姓名： | 庞珊娜 樊晓桠 李涛 |
| |
| 作者单位： | 西北工业大学航空微电子中心,西安,710072 |
| |
| 摘 要： | RSA算法是目前应用最广泛的一种公钥加密算法,随着人们对加密安全性和加密速度要求的提高,硬件实现加密算法成了密码学应用的一个趋势。模乘算法是模幂算法的核心,基于Montgomery算法,结合Booth2算法的思想,文章给出了一种改进的高效算法,并且通过FPGA实现。对该算法和参考文献中算法的性能进行了比较,可以看出这一改进算法在速度和面积上优于现有的算法。
|
| 关 键 词： | 模幂运算 模乘运算 RSA |
| 文章编号： | 1002-8331-(2003)31-0107-02 |
| 修稿时间： | 2002年12月1日 |
A Fast Modular Multiplication Algorithm for Hardware Implementation |
| |
| Pang Shanna Fan Xiaoya Li,Tao.A Fast Modular Multiplication Algorithm for Hardware Implementation[J].Computer Engineering and Applications,2003,39(31):107-108. |
| |
| Authors: | Pang Shanna Fan Xiaoya Li Tao |
| |
| Abstract: | RSA is one of the most popular public-key crypto-algorithms.With the increase of the requirement of the security,hardware implementation of crypto -algorithm becomes the direction of crypto -algorithm's application.Modular multiplication is the kernel of modular exponentiation.In this paper,an improved fast modular multiplication algorithm is proposed,which is suitable to be implemented by hardware.This algorithm is based on the Montgomery algorithm and combined with the advantage of Booth2algorithm.The final results by implementing with FPGA show that the performance of the algorithm is better than the existing ones. |
| |
| Keywords: | Modular Exponentiation algorithm Modular multiplication algorithm RSA |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
