Problem 9.84 Modified

The RSA algorithm shows how to generate keys, distribute the keys, encrypt information using

the keys, and decrypt information using the keys. When analyzing an algorithm involved in the

communication of sensitive information, it is helpful to investigate security weaknesses. For

example, it would be trivial to decrypt information encrypted using RSA if the factorization into

two primes of n in the public key was known. Use the quadratic formula to show that if you know

n, (n), and that n was the product of two primes, then you could easily factor n.