Researchers have successfully factored the RSA-896 number

A team of researchers has successfully completed the factorization of RSA-896, breaking down the number into prime factors p and q. The computation process was officially completed on September 19, 2026.

To solve the problem, it took only 13 units of computational power, with the total execution time being 1 hour. Such high processing speed became possible due to the optimization of factor search algorithms, which significantly reduces time costs compared to classical brute-force methods.

The results of the experiment were documented and presented for analysis to the community, as confirmed by the data on Hacker News. The factorization of numbers of this size is an important indicator of the current state of cryptographic resistance and computational capabilities of modern systems.

The successful cracking of RSA-896 demonstrates progress in cryptanalysis methods. Similar studies allow us to assess the real security of existing encryption protocols and the need to transition to more complex data protection algorithms in the near future.