作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2006, Vol. 32 ›› Issue (16): 118-119,. doi: 10.3969/j.issn.1000-3428.2006.16.044

• 安全技术 • 上一篇    下一篇

RSA算法中几种可能泄密的参数选择

谢建全1,2;阳春华1   

  1. 1. 中南大学信息科学与工程学院,长沙 410083;2. 湖南财经高等专科学校,长沙 410205
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2006-08-20 发布日期:2006-08-20

Several Possible Parameters Options Causing Encryption Failure in RSA Algorithm

XIE Jianquan1,2;YANG Chunhua1   

  1. 1. Information Engineering College, Central South University, Changsha 410083; 2 Hunan Finance and Economics College, Changsha 410205
  • Received:1900-01-01 Revised:1900-01-01 Online:2006-08-20 Published:2006-08-20

摘要: RSA加密算法是目前使用较多、安全性高的一种非对称加密算法,在实际应用中要使该算法有较高的防破解强度,在大素数的选择上是有要求的。文章给出了选择高质量的大素数的有效方法,并对一些不当的选择可能造成的泄密给出了相应的证明。

关键词: 大素数, RSA算法, 安全性, 攻击

Abstract: RSA encryption algorithm is a popular unsymmetrical encryption with high secure character. There are some special requirements in the selection of the large prime number in order to prevent the decryption. An efficient method has been introduced, which can be used to select the large prime numbers, and the some reasons which cause lower security by selecting incorrect prime number have been proved.

Key words: Big primes, RSA algorithms, Security, Attack