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.
通過理論分析得出該算法的安全性基於大整數分解和求解離散對數的難解性。