# Is it possible to decrypt an RSA ciphertext with only $N$ and $e$?

Is it possible to perform RSA decryption if one only knows $N$ and $e$?

Failing that, what is the maximum key length where brute-force is still practically feasible?

-
The $N$ you provide is 512-bit long, not 128 (unless I messed up a calculation). If it were 128 bits long, and you had a couple of hours (possibly days depending on your gear) to spare, brute-forcing it would be feasible. For 512 I'm not so sure. –  rath Nov 21 '13 at 0:46
I've edited your question. If my edit gets accepted you'll notice it's been trimmed down quite a bit. I did this because requests to decrypt a block of data are off-topic on this site, and your question would get closed as a result. If you feel I've been too liberal with my edit, feel free to rollback, but keep in mind the above. Cheers –  rath Nov 21 '13 at 0:52

The current best way of decryption an RSA ciphertext (assuming good padding was used) is to factor $N$ into its prime factors $p$ and $q$, and from that, reconstruct the decryption exponent $d = e^{-1} \bmod lcm( p-1, q-1 )$
@user10500: lcm == "Least Common Multiple"; lcm(a,b) is the smallest integer that is a multiple of both a and b. We also have $lcm(a,b) = ab / gcd(a,b)$ (where gcd is the more commonly known greatest common divisor function) –  poncho Nov 21 '13 at 13:03