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的选择密文攻击，并且易于软件实现。
Because the sensitive data is encrypted, any direct attack on the database file analysis, can only see the ciphertext.
由于敏感数据被加密，任何直接对数据库文件进行分析的攻击方式，都只能看到密文。
Under the assumption that the random high-density knapsack problem is infeasible, the proposed schemes are provably secure against ciphertext-only attack.
在高密度随机背包困难性假设下，可以证明方案在唯密文攻击下是安全的。
应用推荐