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的选择密文攻击，并且易于软件实现。
On the basis of requesting another factorization of an integer in only one way, two interesting asymptotic formulas on cub complements are obtained through the elementary method.
在通过对任一正整数提出另外一种唯一分解式的基础上，利用初等方法得到了关于立方补数的几个有趣的渐近公式。
Public key RSA mainly depends on the establishment of the factorization difficulty of a big integer.
公钥密码算法RS A主要是依赖于大数的因数分解的困难性建立的。
RSA 's security relies on the factorization of large Numbers, but not theoretically prove the difficulty of deciphering the RSA and the difficulty of large integer equivalent.
RSA的安全性依赖于大数的因子分解，但并没有从理论上证明破译rsa的难度与大数分解难度等价。
RSA 's security relies on the factorization of large Numbers, but not theoretically prove the difficulty of deciphering the RSA and the difficulty of large integer equivalent.
RSA的安全性依赖于大数的因子分解，但并没有从理论上证明破译rsa的难度与大数分解难度等价。
应用推荐