+**Integer Factorization** is the process of breaking a composite [Number](/wiki/number) into its prime factors, which are the [Prime Number](/wiki/prime_number) components that multiply together to form the original number. This fundamental problem in [Number Theory](/wiki/number_theory) is computationally difficult for very large numbers, forming the bedrock for much of modern [Cryptography](/wiki/cryptography).
+## See also
+- [Prime Number](/wiki/prime_number)
+- [Algorithm](/wiki/algorithm)
+- [Public Key](/wiki/public_key)
... 1 more lines