| Montgomery算法在ARM上的快速实现 |
| |
| 引用本文： | 李明久,季晓勇,刘鞭箭.Montgomery算法在ARM上的快速实现[J].微型电脑应用,2006,22(10):44-45,52. |
| |
| 作者姓名： | 李明久 季晓勇 刘鞭箭 |
| |
| 作者单位： | 南京大学电子科学与工程系 |
| |
| 摘 要： | Montgomery算法作为一种快速大数模乘算法,常被应用于RSA、ElGamal等公钥密码算法的基本运算。但是很少有文章对其进行具体理论分析。本文对Montgomery算法进行了深入的剖析,系统地进行了理论推导,并提出了针对ARM7芯片的优化实现方案。采用该方案可以使RSA算法的运行速度有很大提升。
|
| 关 键 词： | RSA Montgomery算法 模乘 ARM |
| 文章编号： | 1007-757X（2006）10-0044-02 |
| 收稿时间： | 2006-02-22 |
| 修稿时间： | 2006-02-22 |
A Fast Implementation of Montgomery Algorithm on ARM |
| |
| LI Ming-jiu,JI Xiao-yong,Liu Bian-jian.A Fast Implementation of Montgomery Algorithm on ARM[J].Microcomputer Applications,2006,22(10):44-45,52. |
| |
| Authors: | LI Ming-jiu JI Xiao-yong Liu Bian-jian |
| |
| Abstract: | Montgomery algorithm is a fast modular multiplication algorithm and has been widely used in the basic operation of public key cryptography algorithms such as RSA and ElGamal. However, there're few papers focusing on it theoretically and systematically. The algorithm is analyzed deeply and deduced systematically in this paper. Based on ARM chip, Montgomery Algorithm is optimized so that it can enhance the implementation speed of modular multiplication in RSA algorithm. |
| |
| Keywords: | RSA Montgomery algorithm Modular multiplication ARM |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
