摘要
RSA算法是基于数论的公开密钥密码体制。RSA算法的实现难度大,运算时间长。而影响其运算速度的主要因素是大数模幂算法和私钥算法。本文提出了改进大数模幂算法和快速计算私钥算法,并加以实现,该算法可以提高RSA算法的运算速度。
The RSA algorithm based on the number theory is one of the public key encryption.But it is complicated and difficult in encryption and decryption.The main factor that affects the calculation speed of RSA encryption is the modular calculation on large numbers and finding the secret key.In this paper,we discuss how to improve the the modular calculation and quick finding the secret key.The increase of the calculation speed of RSA is implemented in an example.
出处
《微计算机信息》
北大核心
2006年第06X期118-119,共2页
Control & Automation
基金
河北省自然科学基金项目(F2005000515)
关键词
RSA
算法
横幂
RSA,Algorithm,Modular Exponentiation
