| 基于RSA的数字签名算法及其快速实现 |
| |
| 引用本文： | 刘学清,李梅,宋超,朱艳琴.基于RSA的数字签名算法及其快速实现[J].数字社区&智能家居,2009(11):8717-8718. |
| |
| 作者姓名： | 刘学清 李梅 宋超 朱艳琴 |
| |
| 作者单位： | 苏州大学计算机科学与技术学院,苏州江苏215006 |
| |
| 摘 要： | 在基于RSA的数字签名算法中，直接决定实现效率的是大数模幂运算。对基于二进制的Montgomery算法进行了改进，并将其应用于大数的模幂运算中。改进后的算法在保证算法快速实现的同时，又节省了算法运算空间。
|
| 关 键 词： | 数字签名 RSA Montgomery算法 模乘 |
The Introduction and Fast Implementation of Digital Signature Algorithm Based on RSA |
| |
| LIU Xue-qing,LI Mei,SONG Chao,ZHU Yan-qin.The Introduction and Fast Implementation of Digital Signature Algorithm Based on RSA[J].Digital Community & Smart Home,2009(11):8717-8718. |
| |
| Authors: | LIU Xue-qing LI Mei SONG Chao ZHU Yan-qin |
| |
| Affiliation: | (School of Computer Science ＆ Technology, Soochow University, Suzhou 215006, China) |
| |
| Abstract: | The efficiency of digital signature algorithm based on P.SA depends on the modular exponentiation of large integer. We improved the binary Montgomery algorithm and use it in the modular exponentiation of large integer. On the foundation of fast speed,the improved way can also save operation space. |
| |
| Keywords: | digital signature R SA Montgomery algorithm modular multiplication |
| 本文献已被 维普 等数据库收录！ |
