摘要
RSA算法的安全性依赖于大数的因数分解的困难性。目前安全素数产生难度大,运算时间长。文章根据素数的特殊表示法研究了一种高速的安全素数算法。
The safe of RSA algorithm based on difficuhy in the large number faetorization.h is much complicated and difficulty in calculation safety prime number. According to the prime number representation,the paper researches the method of High-speed calculation safety prime number.
出处
《电脑与信息技术》
2006年第5期39-41,共3页
Computer and Information Technology
关键词
RSA
安全素数
算法
RSA
safe prime number
algorighm
