首页 | 本学科首页   官方微博 | 高级检索  
     

大素数在公钥密码中的应用及概率生成法的可行性
引用本文:潘红艳. 大素数在公钥密码中的应用及概率生成法的可行性[J]. 黄石理工学院学报, 2009, 25(5): 28-30
作者姓名:潘红艳
作者单位:黄石理工学院,数理学院,湖北,黄石,435003
基金项目:国家标准委员会科研课题 
摘    要:在详细介绍公要密码中RSA系统的加密、解密的基础上,分析了该系统安全的关键是大素数的生成。在现有的大素数生成方法里,概率生成法理论简单、应用方便,得到了RSA密码设计者的青睐。文章从数学角度分析了概率生成法的可行性,即在概率生成法几万分之一失效的情况下,对RSA没有安全上的危害。

关 键 词:RSA公钥密码  大素数  素性检验

Application of Big Prime Number in Public-key Cryptography and Feasibility of Probability Generation Method
PAN Hongyan. Application of Big Prime Number in Public-key Cryptography and Feasibility of Probability Generation Method[J]. Journal of Huangshi Institute of Technology, 2009, 25(5): 28-30
Authors:PAN Hongyan
Affiliation:PAN Hongyan (School of Mathematics and Physics, Huangshi Institute of Technology, Huangshi Hubei 435003 )
Abstract:This paper introduces the encryption and decryption of RSA system in public key and concludes that the key of the system security is the generation of big prime number. Among the generating methods of big prime number, the probability generation method, which has simple theory and facilitate application, is popular with RSA key designers. The feasibility of probability generation method has been analyzed from the mathematical point of view and the result has been achieved that the invalidation of probability generation method ( a few ten - thousandth) does not do harm to RSA security.
Keywords:RSA public key  big prime number  primality testing
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号