| 小素数筛值法生成素数实现RSA加密算法 |
| |
| 引用本文： | 池越.小素数筛值法生成素数实现RSA加密算法[J].河北工业大学成人教育学院学报,2006,21(2):16-20. |
| |
| 作者姓名： | 池越 |
| |
| 作者单位： | 河北工业大学信息工程学院,天津,300130 |
| |
| 摘 要： | 描述了概率性素数产生方法,并给出了基于小素数筛值法生成素数的具体算法。应用Rabin-Miller测试和中国余数定理,编写出了生成强伪素数的核心算法的源程序。分析和试验表明,本文算法是切实可行的,而且大大提高了RSA算法中解密过程的实现速度。
|
| 关 键 词： | RSA加密算法 强素数 小素数筛值法 Rabin-Miller测试 |
| 文章编号： | 1008-911X(2006)02-0016-05 |
| 修稿时间： | 2006年2月19日 |
The Study about the Implementation of RSA Encrypt Algorithm in Little Prime Number Building Method |
| |
| CHI Yue.The Study about the Implementation of RSA Encrypt Algorithm in Little Prime Number Building Method[J].Journal of Adult Education School of Hebei University of Technology,2006,21(2):16-20. |
| |
| Authors: | CHI Yue |
| |
| Abstract: | This paper describe the way of producing the probability prime, and show the arithmetic of little Prime Number Building Method. The realization of the programme which create the main strong-prime arithmetic using Rabin - Miller Test and Pocklington theorem. From the analysis and the test, this arithmetic is feasible, and increases the speed of the decryption process in RSA encrypt arithmetic. |
| |
| Keywords: | RSA encryption arithmetic Strong prime Little Prime Number Building Method Rabin-Miller Test |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
