RSA 公钥密码系统就是基于这种因数分解特性的。
RSA public-key cryptography is based on this property of factorization.
一个众所周知的例子是因数分解一个大的数字(尤其是因数较少的数字)。
A well-known example is factoring large Numbers (especially Numbers with few factors).
您可能见到过大整数质因数分解，或是对复杂数据结构的庞大列表进行分类，这些都是长时间运行的操作。
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.
应用推荐