| AKS算法及其在公钥加密术中的意义 |
| |
| 引用本文： | 赵勇,张益新,杨文伟.AKS算法及其在公钥加密术中的意义[J].广东工业大学学报,2004,21(3):79-82,93. |
| |
| 作者姓名： | 赵勇 张益新 杨文伟 |
| |
| 作者单位： | 广东工业大学,计算机学院,广东,广州,510090;广东工业大学,网络信息中心,广东,广州,510090 |
| |
| 摘 要： | AKS算法是3位印度的计算机科学家于2002年8月提出的，它是一个能在输入规模的多项式时间内确定的对一个数进行素性测试的方法．本文详细介绍了AKS算法的基本思想、算法流程以及时间复杂度的分析，又由于大素数的选取在公钥加密术中极为重要，因此讨论了AKS算法在公钥加密术中的意义。
|
| 关 键 词： | AKS算法 RSA算法 公钥加密术 |
| 文章编号： | 1007-7162(2004)03-0079-04 |
AKS Algorithm and It's Effect on Public-key Encryption |
| |
| ZHAO Yong,ZHANG Yi-xin,YANG Wen-wei.AKS Algorithm and It's Effect on Public-key Encryption[J].Journal of Guangdong University of Technology,2004,21(3):79-82,93. |
| |
| Authors: | ZHAO Yong ZHANG Yi-xin YANG Wen-wei |
| |
| Affiliation: | ZHAO Yong~1,ZHANG Yi-xin~1,YANG Wen-wei~2 |
| |
| Abstract: | AKS algorithm was proposed by three computer scientists in India in Aug 2002.This algorithm can unconditionally determine whether an input number is a prime in polynomial time. In this paper, the basic idea, the algorithm and the time complexity analysis of AKS algorithm are described in detail. The impact of this algorithm on public-key encryption is discussed because the selection of a big prime is very important to it. |
| |
| Keywords: | AKS algorithm RSA algorithm public-key encryption |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
