Integer factorization: Difference between revisions

Revision as of 20:49, 30 October 2023

Revision as of 07:19, 5 November 2023

Line 27:

== Current state of the art ==

{{See also|Integer factorization records}}

Among the ''b''-bit numbers, the most difficult to factor in practice using existing algorithms are those that[[semiprimes]] arewhose productsfactors of two primesare of similar size. For this reason, these are the integers used in cryptographic applications. The largest such semiprime yet factored was [[RSA numbers#RSA-250|RSA-250]], an 829-bit number with 250 decimal digits, in February 2020. The total computation time was roughly 2700 core-years of computing using Intel [[Skylake (microarchitecture)#Xeon Gold (quad processor)|Xeon Gold]] 6130 at 2.1 GHz. Like all recent factorization records, this factorization was completed with a highly optimized implementation of the [[general number field sieve]] run on hundreds of machines.

=== Difficulty and complexity ===