| RSA算法的一种快速软件实现 |
| |
| 引用本文： | 田莹,王丽君,张学东.RSA算法的一种快速软件实现[J].计算机应用与软件,2004,21(3):91-92. |
| |
| 作者姓名： | 田莹 王丽君 张学东 |
| |
| 作者单位： | 鞍山科技大学计算机学院,鞍山,114000 |
| |
| 摘 要： | RSA算法是基于数论的公开密钥密码体制。RSA算法已经成为现在最流行的公钥加密算法和数字签名算法之一。RSA算法的加密、解密操作要进行十进制位数达百位以上的大数运算，实现难度大，运算时间长。而影响其运算速度的主要因素是大数乘幂算法和取余算法。本文提出一种改进大数乘幂算法和取余算法，并加以实现，该算法可以提高RSA算法的运算速度。
|
| 关 键 词： | 密码学 数字签名 保密通讯 公钥密码体制 RSA算法 软件 |
A FAST IMPLEMENTATION OF RSA ENCRYPTION |
| |
| Tian Ying,Wang Lijun,Zhang Xuedong.A FAST IMPLEMENTATION OF RSA ENCRYPTION[J].Computer Applications and Software,2004,21(3):91-92. |
| |
| Authors: | Tian Ying Wang Lijun Zhang Xuedong |
| |
| Abstract: | The algorithm RSA based on the number theory is one of the most popular public key encryption and digital signature algorithm.But it is complicated and difficult in encrypting and decrypting,because it has to calculate large numbers more than 100 digits.The main factor that affects the calculation speed of RSA encryption is the exponentiation calculation and the modular calculation on large numbers.In this paper,we discuss how to improve the exponentiation calculation and the modular calculation.The increase of the calculation speed of RSA encryption is implemented in an example. |
| |
| Keywords: | RSA Public-key Exponentiation Modular |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
