电子学报 ›› 2014, Vol. 42 ›› Issue (10): 2081-2085.DOI: 10.3969/j.issn.0372-2112.2014.10.033

• 科研通信 • 上一篇    下一篇

基于遍历矩阵的公钥加密方案的安全性分析

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

  1. 1. 江苏理工学院计算机工程学院, 江苏常州 213001;
    2. 中国科学技术大学计算机科学与技术学院, 安徽合肥 230027;
    3. 南京邮电大学计算机学院, 江苏南京 210003
  • 收稿日期:2011-10-13 修回日期:2014-04-19 出版日期:2014-10-25
    • 作者简介:
    • 古春生 男,1971年3月生,安徽芜湖人,2005年获中国科学技术大学管理科学与工程学博士学位,现为江苏理工学院副教授,主要从事公钥密码学方面研究. E-mail:guchunsheng@gmail.com;景征骏 男,1978年10月生,江苏丹阳人,现为南京邮电大学博士研究生,主要从事数字签名方面研究. E-mail:jzj.jstu@gmail.com
    • 基金资助:
    • 国家自然科学基金 (No.61142007); 江苏理工学院科研基金 (No.KYY12027); 江苏省高校自然科学研究 (No.13KJB520005); 江苏省普通高校研究生科研创新计划 (No.CXZZ13_0493); 教育部人文社会科学研究项目 (No.14YJAZH023); 江苏省"青蓝工程"项目

Security on Public Key Encryption Scheme Based on Ergodic Matrices

GU Chun-sheng1,2, JING Zheng-jun1,3, YU Zhi-min1, WU Fang-sheng1   

  1. 1. School of Computer Engineering, Jiangsu University of Technology, Changzhou, Jiangsu 213001, China;
    2. School of Computer Science and Technology, University of Science and Technology of China, Hefei, Anhui 230027, China;
    3. School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing, Jiangsu 210003, China
  • Received:2011-10-13 Revised:2014-04-19 Online:2014-10-25 Published:2014-10-25
    • Supported by:
    • National Natural Science Foundation of China (No.61142007); Research Fund of Jiangsu University of Technology (No.KYY12027); Natural Science Research Program of Colleges and Universities of Jiangsu Province (No.13KJB520005); Graduate Research Innovation Program of univerities in Jiangsu Province (No.CXZZ13_0493); Humanities and Social Science Research Projects of Ministry of Education of China (No.14YJAZH023); Blue Project in Jiangsu Province

摘要:

针对裴士辉等构造的基于遍历矩阵的公钥加密方案,本文使用遍历矩阵性质和线性化方法,证明破解该公钥加密方案不比求解多项式有限域上离散对数问题更难,从而证明了他们关于该公钥加密方案的安全归约证明是不正确的.

关键词: 公钥密码学, 遍历矩阵, 离散对数问题, 安全性分析

Abstract:

For the public key encryption scheme based on the ergodic matrices constructed by Pei et al., this paper proves that breaking this scheme is not harder than solving polynomial discrete logarithm problem on finite field applying the properties of ergodic matrices and linearization method.Thus, we show that their proof of security is not correct for this public key encryption scheme.

Key words: public key cryptography, ergodic matrix, discrete logarithm problem, security analysis

中图分类号: