Introduction - If you have any usage issues, please Google them yourself
The greatly integer factorization difficulty determines the reliability of the RSA algorithm. In other words, the maximum integer factorization is the more difficult RSA algorithm is more reliable. Nevertheless, only some variant of the RSA algorithm [citation needed] proved its security depends on the factorization. If someone finds a fast factorization algorithms, so the reliability of the information used RSA encryption will certainly extreme decline. But found the possibility of such an algorithm is very small. Today only short RSA keys to be a powerful way cracked. Until 2008, the world' s no reliable way to attack the RSA algorithm. As long as the length of the key is long enough, with the RSA encryption information is actually not be cracked. But in today' s distributed computing and quantum computer theory matures, RSA encryption security has been challenged.