说明：  对极大整数做因数分解的难度决定了RSA算法的可靠性。换言之，对一极大整数做因数分解愈困难，RSA算法愈可靠。假如有人找到一种快速因数分解的算法的话，那么用RSA加密的信息的可靠性就肯定会极度下降。但找到这样的算法的可能性是非常小的。今天只有短的RSA钥匙才可能被强力方式解破。到目前为止，世界上还没有任何可靠的攻击RSA算法的方式。只要其钥匙的长度足够长，用RSA加密的信息实际上是不能被解破的。
(The difficulty of factorization for maximum integers determines the reliability of RSA algorithm. In other words, the more difficult it is to factor a maximum integer, the more reliable RSA algorithm will be. If someone had found a fast factorization algorithm, the reliability of the information encrypted with RSA would have been greatly reduced. But finding such an algorithm is highly unlikely. Only short RSA keys can be broken in brute force today. So far, there is no reliable way to attack RSA algorithms in the world. As long as the key is long enough, the message encrypted with RSA is virtually unbreakable.)