Integer factorization decomposes an integer into prime factors. RSA relies on the difficulty of factoring large integers: available algorithms are slow for sufficiently large numbers, making the computation a security barrier. section 6.3
That barrier is not permanent. Faster computers, improved algorithms, or practical quantum computers could make factoring easier and undermine RSA, so cryptographic choices must account for changing computational power. section 6.3 section 6.6
Factorization matters because it:
- Supports RSA encryption and digital signatures through a computational challenge involving large prime factors. section 6.3 section 6.6
- Requires attention to key sizes as factoring methods and computing power improve; 2,048-bit RSA is the minimum stated, with larger sizes recommended for long-term security. section 6.6
