摘 要RSA算法是基于数论的公开密码体制，是公开密钥密码体制中最优秀的加密算法。在RSA中，最基本的运算是xy (mod z) ,其中，x、y和z是高达100－200位的十进制数。 然而，RSA算法的加密、解密操作要进行十进制位数达百位以上的大数运算，实现难度大，运算时间长，而其运算速度的主要因素是大数乘幂算法和取余算法。本文将讨论改进大数乘幂算法和取余算法，发提高RSA算法的运算速度。
关键词： RSA 加密 公开密钥密码 算法
Abstract algorighm RSA based on the numberic theory is the best encryption algorighm in public-key cryptosystems. In the RSA cryptosystem, the basic calculation is xy (mod z), in x , y and z can be numbers of about 100-200digits. Therefore It is much complicated and difficult in encihering and decipheting, because it has to calculate the big numbers more than 100 digits. The main factor that affects the calculating speed of RSA is the algorithms of the exponentiation calculation and the modular calculation on big numbers. In this paper, we will discuss how to improve the algorithms of the exponentiation calculation and the modular calculation to increase the calculating speed of RSA.
Keywords: RSA , Encriyption , Public-key Cipher , Algorighm
付费论文:19000多字 有目录、绪论、、源程序、翻译译文及其原文、流程图 400元
备注:此文版权归本站所有；本站保证购买者的省唯一性。