| 对大整数n=pq分解的一个有效的搜索算法 |
| |
| 引用本文： | 董庆宽,傅晓彤,肖国镇.对大整数n=pq分解的一个有效的搜索算法[J].电子学报,2001,29(10):1436-1438. |
| |
| 作者姓名： | 董庆宽 傅晓彤 肖国镇 |
| |
| 作者单位： | 西安电子科技大学 |
| |
| 基金项目： | 国家自然科学基金 (No .60 0 730 51 )，基于数学的密码理论研究 (No .G1 9990 3580 4 ) |
| |
| 摘 要： | 本文通过构造一个简单的基于调差思想的搜索算法和一个快速的开方算法对满足一定条件的大整数n=pq(p、q为大素数 )进行快速分解 .从而指出基于因子分解的密码体制中存在着相当多的弱密钥 ,而且很难避免选取这些弱密钥 .这对于我们分析基于因子分解的公钥体制的安全性是很有意义的
|
| 关 键 词： | 因子分解 密码学 RSA |
| 文章编号： | 0372-2112(2001)10-1436-03 |
| 修稿时间： | 2000年6月2日 |
An Effective Searching Algorithm for Factoring Large Integer n = pq |
| |
| DONG Qing kuan,FU Xiao tong,XIAO Guo zhen.An Effective Searching Algorithm for Factoring Large Integer n = pq[J].Acta Electronica Sinica,2001,29(10):1436-1438. |
| |
| Authors: | DONG Qing kuan FU Xiao tong XIAO Guo zhen |
| |
| Abstract: | An effective searching algorithm based on a new idea,difference adjusted,and a fast algorithm for calculating square root are presented to factorize large integer n=pq(p?q are large primes) in some conditions.Consequently,a great deal of weakness existing in the cryptosystem based on the factorization are found and it is very difficult to avoid selecting them in practice.It can be well used in the analysis of the secure in the public key cryptosystem based on the factorization. |
| |
| Keywords: | factoring cryptography RSA |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
