期刊文献+

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

The Machine Testing and Software Realizing of Primality of Large Number
下载PDF
导出
摘要 探索和研究了素数的寻找及其素性测试的理论方法,给出了由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.
机构地区 邵阳学院数学系
出处 《南华大学学报(自然科学版)》 2006年第2期96-99,共4页 Journal of University of South China:Science and Technology
关键词 素性测试 JACOBI Sums测试 ECPP测试 proving primality Jacobi Sums Proving ECPP
  • 相关文献

参考文献6

  • 1Henri Cohen.A Course in Computational Algebraic Number Theory[J].Springer-Verlag,1996,50:467-473.
  • 2Cohen H,Lenstra Jr.Primality Testing and Jacobi Sums[J].Math.Comp.,1984,42:297-330.
  • 3Atkin AOL,Morain F.Elliptic Curves and Primality Proving[J].Math.Comp.,1993,61(7):29-68.
  • 4A Wiles.Modular Elliptic Curves and Fermat's Last Theorem,[J].Ann.Math.,1995,141(3):443-551.
  • 5Lenstra Jr.Algorithms in Number Theory[A].In:Handbook of Theoretical Computer Science,Vol A:Algorithms and Complexity[C].Amsterdam and New York:The MIT Press,1990:673-715.
  • 6Adleman L M,Pomerance C,Rumely R S.On Distinguishing Prime Numbers from Composite Numbers[J].Ann.Math.,1983,17(1):173-206.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部