| 现代密码学中的素性测试问题 |
| |
| 引用本文： | 朱永娇.现代密码学中的素性测试问题[J].中国科技信息,2006(12):300-301. |
| |
| 作者姓名： | 朱永娇 |
| |
| 作者单位： | 长沙学院计算机科学与技术系,410003 |
| |
| 基金项目： | 长沙学院校科研和教改项目 |
| |
| 摘 要： | 由于现代密码学正是建立在整数分解理论和计算复杂性理论的基础之上,因此素性测试问题对现代密码学的影响引起了人们的关注.本文将主要讨论现代密码学中的素性测试问题及其算法实现.然后再介绍几种素性测试算法及其实现.
|
| 关 键 词： | AKS算法 现代密码学 RSA算法 |
The Primality Test on Modern Cryptography |
| |
| ZHU Yong-jiao.The Primality Test on Modern Cryptography[J].CHINA SCIENCE AND TECHNOLOGY INFORMATION,2006(12):300-301. |
| |
| Authors: | ZHU Yong-jiao |
| |
| Institution: | Department of computer and technology,ChangSha University,Changsha,Hunan,410003 |
| |
| Abstract: | 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.This paper presents the algorithm that it is possible to determine if a number is a prime in polynomial time.So,they have cracked an age-old mathematical problem. |
| |
| Keywords: | AKS algorithm Modern cryptography RSA algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
