Cracking simple RSA when just the ciphertext and one public key is known Can someone explain to me (Or better yet, point me to a tool that does the brute forcing) how to crack a standard, simple RSA cipher (So don't bother with padding) if I know just one public key, the ciphertext, and some text that I know for sure is part of the plaintext?

Please don't point me to the Wikipedia article or something, I'm trying to get a simple explanation that is fully understandable.
Running RSA backwards would imply cracking the key (determining the private key) and you could brute force that by factoring.  You could generate all possible prime's of the requisite size until you could generate the known public key.  Or perhaps there are other approaches that are more mathematical, that could factor for the primes, which would also be a form of brute force, as currently factoring is thought to be a NP-hard problem.