大整数素性的计算机测试和软件实现  

The Machine Testing and Software Realizing of Primality of Large Number

作　　者：谢文平[1] 陈大钊[1] 

机构地区：[1]邵阳学院数学系,湖南邵阳422000

出　　处：《南华大学学报（自然科学版）》2006年第2期96-99,共4页Journal of University of South China：Science and Technology

摘　　要：探索和研究了素数的寻找及其素性测试的理论方法,给出了由Atkin和Mo-rain提出的确定性素性测试方法及其软件实现,即椭圆曲线素性测试方法(ECPP).最后通过与另一确定性测试方法Jacobi Sum测试方法进行比较,取得了比较理想的结果.In this paper,we have researched some theories of finding primes and proving primality. And we introduced Elliptic Curve Primality Proving（ECPP） put forward by A. O. L. Atkin and F. Morain, and programmed the ECPP software. At last after we compared with Jacobi Sum Proving Method,the results we got show that ECPP really prove the primality good.

关 键 词：素性测试 JACOBI Sums测试 ECPP测试 

分 类 号：O29[理学—应用数学]