If Trudy can factor the modulus N, then she can break the RSA public key cryptosystem. The complexity class for the factorization problem is not known. Suppose that someone proves that integer...

If Trudy can factor the modulus N, then she can break the RSA public key cryptosystem. The complexity class for the factorization problem is not known. Suppose that someone proves that integer factorization is a "really hard problem," in the sense that it belongs to a class of (apparently) intractable problems. What would be the practical importance of such a discovery?