«上一篇/Previous Article|本期目录/Table of Contents|下一篇/Next Article»

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:

26

期数:

2016年08期

页码:

48-51

栏目:

智能、算法、系统工程

出版日期:

2016-08-10

文章信息/Info

Title:

 Research and Improvement of RSA Algorithm

文章编号:

1673-629X（2016)08-0048-04

作者:

 陈春玲; 齐年强; 余瀚

 南京邮电大学 计算机学院

Author(s):

 CHEN Chun-ling; QI Nian-qiang; YU Han

关键词:

 ; RSA ; 安全性; 公钥; 私钥; 时间

Keywords:

 ; RSA; security; public key; private key; time

分类号:

TP301.6

文献标志码:

A

摘要:

 为了提高RSA算法的安全性,避免RSA密码体制中的模n被因子分解,导致私钥d泄露,采取消除密钥中n的分布方法以及对三个因素因子的加密方法。采用消除密钥中n的分布方法可以成功避免在公布的公钥和保密的私钥中出现n,防止攻击者通过因子分解法分解出公钥中n的因子,推导出解密密钥d；采用三因子的加密算法,即使攻击者知道了渍( n),但对于分解n的三个素数没有一个具体的公式,所以加大了分解的困难性,并且因为大素数适当减小了位数,降低了计算量。实验结果表明,该方法提高了RSA算法的安全性,时间复杂度与传统RSA算法相同。

Abstract:

 In order to improve the security of the RSA algorithm and avoid the mathematical factorization of the module n in RSA cryto-system which leads to private key d leaking,the method of eliminating the distribution of n and three-factor encryption algorithm are a-dopted. The results show that the former can successfully avoid the appearance of n in public key and private key,preventing the attacter from using the method of mathematical factorization to get the n factors and deducing the decryption key d . Adopting the latter,even if the attacker knows theφ( n) ,but it doesn’ t have a specific formula to break down the three prime number for decomposition of n . So the difficulty of factoring increases and the computation is reduced due to the reduction of large prime numbers’ s bits. The experimental re-sults indicate that the method increases the security of the RSA algorithm and its time complexity is same to the traditional algorithm.

常用功能

更新日期/Last Update: 2016-09-29