Inverting RSA function I am in high school and I am writing a paper on RSA. I want to show that low values of the public key exponent can make it easy to 'invert' the function so that the encrypted message can be recovered.
How is this done? I have tried to read the Handbook of Applied Cryptography but it's not making sense...

Would this be inversion: 
Taking cipher text, and continuously adding the modulus, then taking the eth root of the sum. If the result is an integer, then it is the plaintext message.
I want to show that low values of the public key exponent can make it easy to 'invert' the function so that the encrypted message can be recovered.


That is not known to be true; as long as the modulus is large enough to make factorization infeasible, there is no known way to compute e-th roots in general.

Now, if the plaintext $p$ is small enough that $p^e &lt; N$, then it is easy to recover $p$ (just take the e-th root over the integers, which is an easy problem).  That's as close as we know to the result you're trying to get.


  Would this be inversion: Taking cipher text, and continuously adding the modulus, then taking the eth root of the sum. If the result is an integer, then it is the plaintext message.


If $N$ is small enough to make work in a practical amount of time, then $N$ is small enough to factor.