针对裴士辉等构造的基于遍历矩阵的公钥加密方案,本文使用遍历矩阵性质和线性化方法,证明破解该公钥加密方案不比求解多项式有限域上离散对数问题更难,从而证明了他们关于该公钥加密方案的安全归约证明是不正确的.
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,w e show that their proof of security is not correct for this public key encryption scheme.