摘要
R大素数的选取是构造RSA密钥的关键。文章介绍了几种可行的大素数生成方法,给出了快速生成大素数的有效方法,并给出了用计算机实现相应算法的步骤。
The selection of large primes is the key to point the construction of RSA secret key. The several practicable methods have been introduced in this paper, and it also gives the ways use the computer to realize and fast efficient methods.
出处
《信息安全与通信保密》
2006年第9期56-58,共3页
Information Security and Communications Privacy
关键词
大素数
素数检测
RSA公钥密码
large prime number prime number detection RSA cryptosystem
