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.
通过理论分析得出该算法的安全性基于大整数分解和求解离散对数的难解性。
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.