 With the ability to recover prime factors, an attacker can compute the secret exponent "d" from a public key , then decrypt "c" using the standard procedure.To accomplish this, an attacker factors "n" into "p" and "q", and computes which allows the determination of "d" from "e".No polynomial-time method for factoring large integers on a classical computer has yet been found, but it has not been proven that none exists.