|
|||||
|
|
| 矩阵环上快速公钥密码算法的安全分析 | |
| 引用本文： | 古春生,吴访升,景征骏,于志敏.矩阵环上快速公钥密码算法的安全分析[J].山东大学学报(理学版),2013,48(9):22-28. |
| 作者姓名： | 古春生 吴访升 景征骏 于志敏 |
| 作者单位： | 1.中国科学技术大学计算机科学与技术学院, 安徽 合肥 230027; 2.江苏理工学院计算机工程学院, 江苏 常州 213001; 3.南京邮电大学计算机学院, 江苏 南京 210003 |
| 基金项目： | 国家自然科学基金资助项目(61142007); 江苏理工学院科研基金资助项目(KYY12027) |
| 摘 要： | 分析适用于资源受限的计算环境的快速公钥密码算法的安全性非常重要。通过使用格归约算法,证明破解基于矩阵环的快速公钥密码算法的难度并不比整数分解问题更难,即给定整数分解神谕,存在多项式时间求解其等价私钥,并通过计算实验演示安全分析的正确性。 |
| 关 键 词： | 公钥密码体制 整数分解 密码分析 格归约 |
| 收稿时间： | 2013-03-01 |
Security analysis of fast public key cryptosystem on matrix ring |
|
| GU Chun-sheng,WU Fang-sheng,JING Zheng-jun,YU Zhi-min.Security analysis of fast public key cryptosystem on matrix ring[J].Journal of Shandong University,2013,48(9):22-28. | |
| Authors: | GU Chun-sheng WU Fang-sheng JING Zheng-jun YU Zhi-min |
| Institution: | 1.School of Computer Science and Technology, University of Science and Technology of China, Hefei 230027, Anhui, China; 2. School of Computer Engineering, Jiangsu University of Technology, Changzhou 213001, Jiangsu, China; 3. School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing 210003, Jiangsu, China |
| Abstract: | It is very important to analyze the security of fast public key cryptosystem suitable for computing devices with limited resources. By applying lattice reduction algorithm, it is not more difficult than the integer factorization problem to break the fast public key cryptosystem based on matrix ring. That is, given an oracle of factoring integers, there exists a polynomial time algorithm which solves the secret key from the public key. The correctness of security analysis is demonstrated by computational experiments. |
| Keywords: | public key cryptosystem integer factorization cryptanalysis lattice reduction |
| 点击此处可从《山东大学学报(理学版)》浏览原始摘要信息 | |
| 点击此处可从《山东大学学报(理学版)》下载免费的PDF全文 | |