通信学报 ›› 2015, Vol. 36 ›› Issue (8): 61-67.doi: 10.11959/j.issn.1000-436x.2015128

• 学术论文 • 上一篇    下一篇

遍历矩阵密码体制的安全性

黄华伟1,彭长文2,瞿云云1,李春华3   

  1. 1 贵州师范大学 数学与计算机科学学院,贵州 贵阳 550001
    2 贵州师范学院 数学与计算机科学学院,贵州 贵阳 550018
    3 华东交通大学 理学院, 江西 南昌 330013
  • 出版日期:2015-08-25 发布日期:2015-08-25
  • 基金资助:
    国家自然科学基金资助项目;国家自然科学基金资助项目;贵州省科学技术基金资助项目;贵州省科学技术基金资助项目;贵州师范大学博士基金资助项目

Security of the cryptosystems based on ergodic matrices

Hua-wei HUANG1,Chang-wen PENG2,Yun-yun QU1,Chun-hua LI3   

  1. 1 School of Mathematics and Computer Science,Guizhou Normal University,Guiyang 550001,China
    2 School of Mathematics and Computer Sciences,Guizhou Normal College,Guiyang 550018,China
    3 School of Science,East China Jiaotong University,Nanchang 330013,China
  • Online:2015-08-25 Published:2015-08-25
  • Supported by:
    The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Doctorial Foundation of Guizhou Normal University

摘要:

分析了基于有限域遍历矩阵的公钥密码体制的安全性。根据公钥,采取逆矩阵消去方法得到伪造私钥的线性方程组。从而证明了计算性TEME问题是多项式时间可解的,利用伪造私钥即可破解PZZ1密码体制的密文。在一些情况下,SEME 问题在多项式时间内可归约为离散对数问题,若密钥参数选取不当,PZZ2 密码体制是基于离散对数问题的,并不基于NP困难问题。

关键词: 遍历矩阵, 公钥密码, 计算复杂度, 有限域, 算法

Abstract:

The security of the public-key cryptosystems based on ergodicmatrices over finite field was analysed.According to the public key,a system of linear equations for the forged secret key bits is obtained by inverse matrix elimination method.It is proved that the computational TEME problem is solvablein polynomial time and the ciphertext of the PZZ1 cryptosystem can be decrypted by the forged secret key.In some case the SEME problem can be reduced to discrete logarithm problem in polynomial time.If the key parameters are chosen improperly,then PZZ2 cryptosystem is based on discrete logarithm problem instead of NP hard problem.

Key words: ergodic matrix, public-key cryptography, computational complexity, finite field, algorithm

No Suggested Reading articles found!