The Prime Factorization Problem
RSA security relies on the computational difficulty of factoring the product of two large primes. A 2048-bit RSA key uses two ~1024-bit primes whose product (the modulus n) has approximately 617 decimal digits. The best known classical algorithm (General Number Field Sieve) would require approximately 2112operations to factor a 2048-bit modulus — far beyond current computing capacity. The largest RSA number factored publicly is RSA-250 (829 bits), which took 2,700 CPU-years in 2020.