Define slow tedunangst - Big O notation please.
Maybe you can look here: http://en.wikipedia.org/wiki/Modular_exponentiation.
Ok, I'll save you the trouble -- the modular exponentiation is O(log exponent). That's log as in... FAST.
Maybe you can look here: http://en.wikipedia.org/wiki/Modular_exponentiation.
Ok, I'll save you the trouble -- the modular exponentiation is O(log exponent). That's log as in... FAST.
Constants matter.
(Also, computational complexity of crypto algorithms is usually specified in terms of nbits, not numeric magnitude)
(Although this argument has given me an idea for everyone that thinks using the same password on different sites is reasonable - a browser extension that runs a client-side KDF :P)