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.
量子計算的快速發(fā)展給基于整數(shù)分解或離散對數(shù)問題的密碼協(xié)議帶來嚴(yán)重威脅。
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算法相似，其安全性基于大數(shù)因式分解的難度，能夠抵抗對于RSA的選擇密文攻擊，并且易于軟件實現(xiàn)。
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.
通過理論分析得出該算法的安全性基于大整數(shù)分解和求解離散對數(shù)的難解性。