大素数生成算法.doc

PAGE PAGE 21 大素数生成算法 摘要： 随着当代社会信息化的来临，计算机网络中的信息传输量呈现出几何级的增长趋势，总所周知信息在传输的过程中可能会存在泄密的情况，所以在当今信息量如此庞大的现代网络应用中，信息安全不可避免成为了一个核心问题。 非对称加密体制中的RSA公钥密码体制是目前较为完善、安全、实用的公钥算法，已经成为了公钥密码的国际标准，广泛应用到军事、商业等领域之中，比如人们最熟悉的网上购物、网上银行使用的U盾等就使用了RSA加密算法。在RSA加密算法中，安全性是基于大整数的分解问题，所以生成符合RSA算法要求的大素数是一个具有重要意义的研究方向。 根据数论可知，只能被自身和1整除的数称为素数。其关键问题就是给定一个大数，如何来判定这个大数是否为素数，根据定义，可以用比其小的素数去除，但是当这个数很大时，这种方法就不具有可操作性。所以判定一个大数是否为素数成为了许多科学家所关注的问题。 本论文的撰写过程中，系统了解了大素数生成的几种算法，参考了有关大素数素性判定的若干国内外文献，在系统学习了各种素数检测方法的基础上，对经典算法中的大素数生成方法进行了改进，在原先经典算法的基础上增加了一个数据库，用来判断新生成的素数和先前生成的素数是否互素，从而降低通过扩展欧几里得算法求最出大公约数使RSA被破解的可能。 关键词：信息安全，密码学，素数，素性检测 Big Prime Number Generation Algorithm Abstract: With the advent of modern information society, computer network information transfer amount exhibit geometric growth trend in the process of transmission of information that might leak case there will be total is well known, it is such a large amount of information in todays modern network applications, information security has become a central issue unavoidable. Asymmetric encryption system in the RSA public-key cryptosystem is the more perfect, safe and practical public key algorithm, it has become the international standard public key cryptography, being widely applied to military, commercial and other fields, such as one of the most familiar Online shopping, U shield online banking, etc. on the use of the RSA encryption algorithm. In the RSA encryption algorithm, the security issue is based on the decomposition of large integers, so generate large prime numbers in line with the requirements of the RSA algorithm is having a significant research. According to number theory shows that can only be called its own and a number divisible prime number. The key question is, given a large number, how to determine whether the large number of prime numbers, by definition, you can use small primes than their removal, but when this number is large, this method is not feasible. It is determined whether a large number of prime numbers become a pro