One of cryptography's main foundations, the RSA encryption algorithm, had had its security forcibly raised by the young man's proposed solution to the factorization sieve attack, reaching a level no weaker than Elliptic Curve Cryptography. The difficulty of cracking it had directly reached the exponential level.
According to a public report released by IEEE yesterday, under Xiao's factorization sieve attack solution, the key length required by the RSA encryption system had been greatly reduced.
In the past, the recommended key length for ECC encryption was 256 bits, while the recommended length for RSA encryption was as high as 1024 bits, or even 2048 bits.
The higher the bit length, the lower the efficiency.
After all, while a higher bit length increased the computational workload required to crack a password directly, it also increased the time needed to use it. For example, entering a password consumed considerable computing power.
At the same time, as computer performance on Earth grew stronger and cracking speeds became faster, RSA encryption could only keep increasing its key length to ensure security, which was highly inconvenient.
But now...
That report pointed out that when the key length was 277 bits, the difficulty of cracking RSA encryption under Xiao Yi's system was equal to that of ECC.
And if the key length continued to increase, the difficulty of cracking RSA encryption under this system would become increasingly greater than that of ECC encryption.
In other words, as computer performance continued to improve, once ECC's recommended key length exceeded 277 bits, it would no longer have any advantage over RSA.
Thus, almost single-handedly, Xiao Yi had made the RSA encryption system secure once more. For a long time to come, the RSA system would be impossible to eliminate.
In a sense, this saved the entire information security field