FactorizationIntroductionMany public key problems involve the difficulity in factorizing a value two its prime number factors. For example, in RSA, we have a public modulus \(N\) and which is equal to the multiplication of two prime numbers \(p\) and \(q\). If we can factorize the public modulus, we will be able to break the RSA cipher related to it.
|