大素数在公钥密码中的应用及概率生成法的可行性  

Application of Big Prime Number in Public-key Cryptography and Feasibility of Probability Generation Method

作　　者：潘红艳[1] 

机构地区：[1]黄石理工学院数理学院,湖北黄石435003

出　　处：《黄石理工学院学报》2009年第5期28-30,共3页Journal of Huangshi Institute of Technology

基　　金：国家标准委员会科研课题(项目编号:2002134-T-605)

摘　　要：在详细介绍公要密码中RSA系统的加密、解密的基础上,分析了该系统安全的关键是大素数的生成。在现有的大素数生成方法里,概率生成法理论简单、应用方便,得到了RSA密码设计者的青睐。文章从数学角度分析了概率生成法的可行性,即在概率生成法几万分之一失效的情况下,对RSA没有安全上的危害。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.

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

分 类 号：O157.4[理学—数学]