| 一种大素数快速生成算法设计与实现 |
| |
| 引用本文： | 雷文,邱玲,张弘. 一种大素数快速生成算法设计与实现[J]. 四川轻化工学院学报, 2011, 0(3): 313-316 |
| |
| 作者姓名： | 雷文 邱玲 张弘 |
| |
| 作者单位： | 四川理工学院计算机学院,四川自贡643000 |
| |
| 基金项目： | 人工智能四川省（高校）重点实验室科研基金项目（2008RK004;2008RK006） |
| |
| 摘 要： | 针对RSA中对安全大素数的要求,基于对Rabin-Miller测试改进,通过引入预测试方法,设计实现了一个快速大素数产生算法。实验结果显示,算法具有良好的大素数产生效率,分析结果表明其产生的素数具有很高的可信度,具有较强的实际应用意义。
|
| 关 键 词： | Rabin-Miller测试 大素数 生成算法 公钥密码 |
Design and Implement of a Fast Big Prime Generation Algorithm |
| |
| LEI Wen,QIU Ling,ZHANG Hong. Design and Implement of a Fast Big Prime Generation Algorithm[J]. Journal of Sichuan Institute of Light Industry and Chemical Technology, 2011, 0(3): 313-316 |
| |
| Authors: | LEI Wen QIU Ling ZHANG Hong |
| |
| Affiliation: | (School of Computer Science,Sichuan University of Science ＆ Engineering,Zigong 643000,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | Rabin-Miller test big prime generation algorithm public-key cryptosystem |
| 本文献已被 维普 等数据库收录！ |
|
