This certainly doesn't cover issues in implementation or issues in weak choices of messages or keys, but assuming all of those things are good then we've shown that all the obvious mathematical ways to break RSA are equivalent to factoring n. 