| RSA算法中大素数的快速生成方法研究 |
| |
| 引用本文： | 魏钦冰.RSA算法中大素数的快速生成方法研究[J].数字社区&智能家居,2006(20). |
| |
| 作者姓名： | 魏钦冰 |
| |
| 作者单位： | 菏泽学院计算机与信息工程系 山东菏泽274015 |
| |
| 摘 要： | RSA加密算法的安全性是基于两个非常大的质数的乘积;用目前的计算机水平无法分解这一前提的,生成两个满足长度要求的大素数是保证RSA加密的数据安全可靠的前提。本文介绍了几种可行的大素数测试方法,给出了实现用计算机实现相应算法的步骤,并给出了快速生成大素数的有效方法。
|
| 关 键 词： | 大素数 素数检测 RSA体制 |
In RSA Algorithm Big Prime Number Fast Production Method Research |
| |
| WEI Qin-bing.In RSA Algorithm Big Prime Number Fast Production Method Research[J].Digital Community & Smart Home,2006(20). |
| |
| Authors: | WEI Qin-bing |
| |
| Abstract: | The RSA encryption algorithm security is based on two extremely big prime numbers products;Is unable with the present computer level to decompose this premise,produces two to satisfy the length request the big prime number is guarantees the RSA encryption the data security reliable premise.This article introduced several feasible big prime numbers tests method,produced has realized with the computer realization corresponding algorithm step,and produced has fast produced the big prime number the effective method. |
| |
| Keywords: | big prime number prime number examination RSA system |
| 本文献已被 CNKI 等数据库收录！ |
