摘要
为解决电子信息交换过程中的安全问题,在对RSA公开密钥加密算法的数学原理进行描述及分析的基础上,给出了密钥对的生成方法及RSA算法实例。讨论了在密钥对的生成中,大素数选取应满足的要求,还对RSA算法关于大数分解和素数选择的保密性能进行了详细分析并提出相应的措施。
In order to solve the security problem of electronic message exchange, based on the description and analysis of the mathematic principle of RSA public key eneryption algorithm, this paper gives a method of the creation of a double secret key and an example of RSA algorithm and discusses the requirement for choice of big prime number in the creation of a double secret key, and also gives the detailed discussion on the security of RSA algorithm about a big number decomposition and a prime number choice and the corresponding measure.
出处
《电脑开发与应用》
2006年第9期14-15,18,共3页
Computer Development & Applications
关键词
KSA算法
素数
密钥对
保密分析
RSA arithmetic, prime number,double secret key, security analysis