> Diffie-Hellman is based on discrete logarithms,
> but RSA is not.
Well, sort of, but not entirely. Yes, the obvious way to break RSA is to factor the modulus, and then compute the private key from the public key.But that's not the only thing.
You encrypt by raising the message M to the power of the public key e modulo the public modulus n.
E = M^e (mod n)
That means that log_e(E) = M (mod n) [ This is wrong - see below ]
If you can compute logarithms base e modulo n then given the public information, you can recover M.So unrestricted discrete logs let you break RSA.
Added in edit:
Sorry, I mis-spoke myself as I was (and still am) in a hurry. As benmmurphy correctly points out, this is wrong, but not in an unfixable way. In short:
(all done mod n)
E = M^e (mod n)
log(E) = e.log(M)
log(E)/e = log(M)
exp(log(E)/e) = exp(log(M)) = M
Again, unrestricted discrete log lets you break RSA.PS: There's a non-zero chance I screwed up again - feel free to say so!