large integer factoring problem 大整数分解问题
Factoring Difficult Problem 因式分解难题
factoring representation problem 因子分解表述难题
problem of factoring large numbers 大数因子分解问题
The session key s is divided into the sum of S1 and S2. Under the condition of a large integer factoring problem, S1 is decrypted by constructing a special equation (scheme 1).
将会话密钥s分解成S1与S2之和。在大整数分解困难问题的条件下，构造特殊等式来解密s1(方案1)。
RSA security is based on complex problem of large number factoring, and factorization algorithms that attack RSA system in use are introduced simply.
RS A密码系统的安全性是基于大数分解困难问题。文中简要地介绍了目前攻击RSA密码系统的常用大数分解算法。
Cracking RSA means confronting what mathematicians believe to be the hard problem of factoring large Numbers.
破译rsa意味着数学家所认为的面临分解大量数字因子的难题。
应用推荐