论文部分内容阅读
针对资源受限的计算环境,提出了一个快速公钥密码算法。该密码算法通过使用一个特殊的矩阵分解问题从而避免了在加解密过程中使用计算量较大的模指数运算,因而具有更高的计算效率。分析指出:密码的安全性与整数分解问题有关,但是并不等价于整数分解问题。该密码算法由于使用了特殊的矩阵分解问题,能够抵抗各类私钥恢复攻击和格攻击,因此是一个快速高效的公钥密码。
Aiming at resource-limited computing environment, a fast public-key cryptosystem is proposed. The cryptographic algorithm has a higher computational efficiency by using a special matrix factorization problem that avoids the use of computationally intensive modulus exponentiation during encryption and decryption. Analysis shows that: the security of the password is related to the integer decomposition, but it is not equivalent to the integer decomposition. The cryptographic algorithm is a fast and efficient public-key cryptography because it uses special matrix-decomposition problems and resists various types of private key recovery attacks.