网络与信息安全学报 ›› 2017, Vol. 3 ›› Issue (5): 62-69.doi: 10.11959/j.issn.2096-109x.2017.00166

• 学术论文 • 上一篇    下一篇

整数分解与RSA的安全性

任彦冰   

  1. 西安电子科技大学网络与信息安全学院,陕西 西安 710071
  • 修回日期:2017-03-25 出版日期:2017-05-01 发布日期:2017-05-13
  • 作者简介:任彦冰(1993-),男,甘肃武威人,西安电子科技大学硕士生,主要研究方向为网络与信息安全。

Factorization of big integer and the security of RSA

Yan-bing REN   

  1. School of Cyber Engineering,Xidian University,Xi’an 710071,China
  • Revised:2017-03-25 Online:2017-05-01 Published:2017-05-13

摘要:

提出了 3 种大整数因数分解的方法,并通过这些方法对 RSA 密码算法的安全性做出了界定。根据分析得知,如果不考虑RSA中生成密钥的2个素数之间的差值,单纯地增加2个素数的取值对提高安全性很可能是无效的。最后,给出了两则在 RSA 密码算法下要想产生能提供足够安全强度的密钥应该遵守的建议。

关键词: 大整数, 因数分解, RSA, 密钥长度, 安全性

Abstract:

Three kinds of methods for integer factorization were proposed and the security of RSA was demarcated.RSA is a well-known cryptographic algorithm,using the analysis result of those methods.Through the work,readers could easily realize that if merely enlarged two prime numbers but lost attention of the relevance of them,the security of this algorithm might been missed.In the end,two recommended tactics to choose prime numbers as key of this algorithm were given.

Key words: integer, factorization, RSA, key size, security

中图分类号: 

No Suggested Reading articles found!