一种大素数快速生成算法设计与实现

Design and Implement of a Fast Big Prime Generation Algorithm

针对RSA中对安全大素数的要求,基于对Rabin-Miller测试改进,通过引入预测试方法,设计实现了一个快速大素数产生算法。实验结果显示,算法具有良好的大素数产生效率,分析结果表明其产生的素数具有很高的可信度,具有较强的实际应用意义。

According to requirement of safety big prime in RSA,a fast prime generation algorithm is brought out,which is based on the Rabin-Miller test method and pre-testing.The experiment results show that the improved algorithm can effectively improve the efficiency of generating large prime numbers,the analysis result also shows that the generations have high reliability by using the improved algorithm,so the improved algorithm is very practical.