The difficulty of maximum integer decomposition determines the reliability of RSA algorithm. The more difficult it is to decompose the largest integer, the more reliable the RSA algorithm is.
If someone finds a fast factorization algorithm, the information reliability of RSA encryption will definitely drop greatly. But the possibility of finding such an algorithm is very small.
Only short RSA keys can be cracked strongly. There is no reliable method to attack RSA algorithm in the world. As long as its key length is long enough, the information encrypted by RSA can't be cracked.
Extended data:
Because RSA algorithm is based on the decomposition of large numbers (unable to resist exhaustive attacks), quantum computing can pose a great threat to RSA algorithm in the future.
A quantum computer with n qubits can perform 2 n operations at a time. Theoretically, the RSA algorithm with the key of 1024 bits can be cracked in 1 second with a quantum computer with 5 12 qubits.
1983 MIT applied for a patent for RSA algorithm in the United States. This patent expired on September 2, 20001. Because the algorithm was published before applying for a patent, this patent right is not recognized in most other parts of the world.
Baidu encyclopedia -RSA algorithm