摘要
给出了一种确定性素性判别方法——雅克比和素性判别方法的软件实现,并对其中最关键的多项运算给出了一种快速算法。同时,通过对另一种确定性素性判别方法——AKS算法的存储复杂度的分析,指出AKS算法在PC机上实现的各种困难。最后给出了雅克比和素性判别算法在奔腾IV 1.8 G上的实现结果。
The software implementation of a determined primality test--the Jacobi sum primality test is described, and a fast method for polynomial modular multiplication is presented. At the same time, another determined primality test--AKS＇s algorithm is analysed, and the difficulty in implementing the AKS＇s algorithm on personal computer is pointed. At last, the result of the implementation the Jacobi sum primality test algorithm on Pentium IV 1.8G is given.
出处
《计算机工程与设计》
CSCD
北大核心
2007年第16期3818-3821,共4页
Computer Engineering and Design
