大素数的快速生成研究与实现

Study and implementation of the fast production algorithm of big prime number

文章研究了大素数的生成算法,并给出了基于Miller-Rabin测试和Montgomery大数模幂算法快速生成大素数的算法实现,该算法生成1 0 2

This paper study on the production algorithm of big prime number, and the implementation of the fast production algorithm based on MillerRabin and Montgomery is given.The speed of producing big prime number of 1024 bit is improved four times than that of tradition algorithms.