Prove complexity bound without reduction?
As mentioned on Wikipedia, there is no known proof that breaking RSA is at least as difficult as prime factorization -- and there are reasons to believe it might not be.  In other words, we don't currently expect any such proof to exist.  See the reference listed in Wikipedia.