矩阵环上快速公钥密码算法的安全分析

J4 ›› 2013, Vol. 48 ›› Issue (09): 22-28.

矩阵环上快速公钥密码算法的安全分析

古春生1,2,吴访升2,景征骏2,3,于志敏2

1.中国科学技术大学计算机科学与技术学院, 安徽合肥 230027;
2.江苏理工学院计算机工程学院, 江苏常州 213001;
3.南京邮电大学计算机学院, 江苏南京 210003

收稿日期:2013-03-01 出版日期:2013-09-20 发布日期:2013-09-25
作者简介:古春生(1971- ),男,博士,副教授,研究方向为密码分析. Email:guchunsheng@gmail.com
基金资助:
国家自然科学基金资助项目(61142007); 江苏理工学院科研基金资助项目(KYY12027)

Security analysis of fast public key cryptosystem on matrix ring

GU Chun-sheng1,2, WU Fang-sheng2, JING Zheng-jun2,3, YU Zhi-min2

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

Received:2013-03-01 Online:2013-09-20 Published:2013-09-25

摘要/Abstract

摘要：

分析适用于资源受限的计算环境的快速公钥密码算法的安全性非常重要。通过使用格归约算法,证明破解基于矩阵环的快速公钥密码算法的难度并不比整数分解问题更难,即给定整数分解神谕,存在多项式时间求解其等价私钥,并通过计算实验演示安全分析的正确性。

关键词: 公钥密码体制;整数分解;密码分析;格归约

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.

Key words: public key cryptosystem; integer factorization; cryptanalysis; lattice reduction

古春生1,2,吴访升2,景征骏2,3,于志敏2. 矩阵环上快速公钥密码算法的安全分析[J]. J4, 2013, 48(09): 22-28.

GU Chun-sheng1,2, WU Fang-sheng2, JING Zheng-jun2,3, YU Zhi-min2. Security analysis of fast public key cryptosystem on matrix ring[J]. J4, 2013, 48(09): 22-28.

参考文献

多维度评价

Viewed

Full text

Abstract

Cited

Shared

Discussed