中文摘要：

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

英文摘要：

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 ex- ists a polynomial time algorithm which solves the secret key from the public key. The correctness of security analysis is demonstrated by computational experiments.