将会话密钥s分解成S1与S2之和。在大整数分解困难问题的条件下，构造特殊等式来解密s1(方案1)。
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).
您可能见到过大整数质因数分解，或是对复杂数据结构的庞大列表进行分类，这些都是长时间运行的操作。
You might see examples of prime factorizations of large integers, or sorting huge lists of complex data structures, and those are certainly long running operations.
您可能见到过大整数质因数分解，或是对复杂数据结构的庞大列表进行分类，这些都是长时间运行的操作。
You might see examples of prime factorizations of large integers, or sorting huge lists of complex data structures, and those are certainly long running operations.
应用推荐