| 一种高速的安全素数算法 |
| |
| 引用本文： | 彭接鑫,孙悦红,陈英娟,李萍.一种高速的安全素数算法[J].电脑与信息技术,2006,14(5):39-41. |
| |
| 作者姓名： | 彭接鑫 孙悦红 陈英娟 李萍 |
| |
| 作者单位： | 北京工商大学计算机学院,北京,100037 |
| |
| 摘 要： | RSA算法的安全性依赖于大数的因数分解的困难性。目前安全素数产生难度大，运算时间长。文章根据素数的特殊表示法研究了一种高速的安全素数算法。
|
| 关 键 词： | 安全素数 算法 |
| 文章编号： | 1005-1228(2006)05-0039-03 |
| 收稿时间： | 2006-04-20 |
| 修稿时间： | 2006-05-22 |
An algorithm of high-speed calculation safety prime number |
| |
| PENG Jie-xin,SUN Yue-hong,CHEN ying-juan,LI Ping.An algorithm of high-speed calculation safety prime number[J].Computer and Information Technology,2006,14(5):39-41. |
| |
| Authors: | PENG Jie-xin SUN Yue-hong CHEN ying-juan LI Ping |
| |
| Affiliation: | Computer Science eollege,Beijing Technology and Business University,Beijing 100037, China |
| |
| Abstract: | 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. |
| |
| Keywords: | RSA |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
