Journal on Communications ›› 2015, Vol. 36 ›› Issue (8): 61-67.doi: 10.11959/j.issn.1000-436x.2015128

• Academic paper • Previous Articles     Next Articles

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

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!