| 关于提高RSA算法速度的研究 |
| |
| 引用本文： | 麻常莎,胡爱群.关于提高RSA算法速度的研究[J].信息安全与通信保密,2010(10):80-82. |
| |
| 作者姓名： | 麻常莎 胡爱群 |
| |
| 作者单位： | 东南大学信息安全研究中心,江苏南京210096 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划)基金资助项目 |
| |
| 摘 要： | RSA是第一个既能用于数据加密也能用于数字签名的公开密钥算法，是目前应用最为广泛的数字签名算法。RSA的安全性依赖于大数分解，由于进行的都是大数计算，使得RSA最快的情况也比DES慢100倍，无论软件还是硬件实现，速度一直是RSA的缺陷。从密钥产生、加密和解密的速度制约条件进行了分析，提出了依赖n进制数组大数的表示法、最优个数素数表和中国剩余定理的高性能RSA算法，并在PIC32单片机上对算法进行了测速。
|
| 关 键 词： | 公钥加密算法（RSA） 大数 模算术 |
Research on Improving the Speed of RSA Algorithm |
| |
| MA Chang-sha,HU Ai-qun.Research on Improving the Speed of RSA Algorithm[J].China Information Security,2010(10):80-82. |
| |
| Authors: | MA Chang-sha HU Ai-qun |
| |
| Affiliation: | (SEU Information Security Research Centre, Nanjing Jiangsu 210096, China) |
| |
| Abstract: | RSA is the first public key algorithm for data encryption and digital signature as well, and also the most widelyused digital signature algorithm. RSA＇s security depends on the integer factorization, and bcause of the large-number calculation, the fastest RSA is 100 times slower than DES, either in software or hardware implementation. Thus the speed has always been its defect. Key generation, encryption and decryption speed constraints are analyzed, a kind of high-performance RSA algorithm dependent on N binary array representation of large numbers, the optimal number of primes and the Chinese Remainder Theory is proposed. And the speed measurement on PIC32 MCU is also done. |
| |
| Keywords: | RSA bignum modular arithmetic |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
