| AKS算法对现代密码学的影响 |
| |
| 引用本文： | 刘永亮,姚鸿勋,高文. AKS算法对现代密码学的影响[J]. 计算机工程与应用, 2003, 39(11): 1-3,54 |
| |
| 作者姓名： | 刘永亮 姚鸿勋 高文 |
| |
| 作者单位： | 1. 哈尔滨工业大学计算机科学与工程系,哈尔滨,150001
2. 哈尔滨工业大学计算机科学与工程系,哈尔滨,150001;中国科学院计算技术研究所,北京,100080 |
| |
| 基金项目： | 国家信息安全管理中心项目(编号:2001-研2-A-017)，黑龙江省青年基金(编号:20010601019) |
| |
| 摘 要： | 最近,印度的三个计算机科学家ManindraAgrawal、NeerajKayal和NitinSaxena提出了一个称为AKS的算法。笔者使用这个算法证明了可在多项式时间内对一个整数是否为素数进行确定性的判定,从而解决了一个古老的数学问题。这个结果对于数论和计算复杂性理论的研究与发展具有重要意义。由于现代密码学正是建立在整数分解理论和计算复杂性理论的基础之上,因此这个算法对现代密码学的影响引起了人们的关注。该文将就此进行阐述。
|
| 关 键 词： | AKS算法 现代密码学 RSA算法 |
| 文章编号： | 1002-8331-(2003)11-0001-03 |
The Effect of AKS Algorithm on Modern Cryptography |
| |
| Liu Yongliang Yao Hongxun Gao Wen . The Effect of AKS Algorithm on Modern Cryptography[J]. Computer Engineering and Applications, 2003, 39(11): 1-3,54 |
| |
| Authors: | Liu Yongliang Yao Hongxun Gao Wen |
| |
| Affiliation: | Liu Yongliang 1 Yao Hongxun 1 Gao Wen 1,21 |
| |
| Abstract: | Recently,three computer scientists Manindra Agrawal,Neeraj Kayal and Nitin Saxena in India present an algorithm called AKS.By this algorithm they give a proof that it is possible to determine if a number is a prime in polynomial time.So,they have cracked an age-old mathematical problem.The result has important significance to research and development in both number theory and computational complexity theory.Because modern cryptography is based on the theory of integer factoring and the computational complexity theory,the effect of this algorithm to modern cryptography has been paid significant attention.It will be discussed in this paper. |
| |
| Keywords: | AKS algorithm Modern cryptography RSA algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
