integer factorization problem

基本解释

The rapid development of quantum computing brings great challenge to cryptographic protocols based on the integer factorization or the discrete logarithm problem.
量子计算的快速发展给基于整数分解或离散对数问题的密码协议带来严重威胁。
Its(security) is based on the intractability of the integer factorization problem as RSA, and it is able to resist the chosen-ciphertext attack against RSA and easy to be implemented.
它与RSA算法相似，其安全性基于大数因式分解的难度，能够抵抗对于RSA的选择密文攻击，并且易于软件实现。
Theory analysis indicates that security of the modified ElGamal-like algorithm is based on the intractability of the integer factorization problem and conventional discrete log problem.
通过理论分析得出该算法的安全性基于大整数分解和求解离散对数的难解性。