I was wondering if anyone has an answer to a question on PGP.... About how many calculations does it take to crack a 1024 bit key? If someone has limitless time, money, etc., they can break it...but how many calculations does it take? Also, there is a password used to protect the keyrings. Assuming a strong password how many calculations does that take to break? If there isn't some special method, an assumption that leads nowhere, just how much "brute force" effort is really required? Thanks, Dave
Well, I don't know exactly how many calculations are necessary, but I've seen some posts that have given general numbers... Let me give some examples to try to answer your question. Currently, we estimate about 2500 MIP-years have gone into trying to factor RSA129 (about 425 bits). We estimate we are about 60% through... The whole project taking about 5000 MIP-years. Figure that every ten decimal digits adds one order of magnitude. So, a 512-bit (~155-digit) key would require about 5e7 MIP-years. And a 1024-bit key would require approximately 5e22 MIP-years. (These are approximations -- please do not quote these numbers). Brute-forcing IDEA takes about as much computation as factoring something between a 1200 and 3000 bit RSA key (I've heard both numbers, but I don't know the numbers). So, in the current implementation, RSA is the weak link! Since the passphrase is just a hash to an IDEA key, breaking the secret ring is as hard as either dictionary attacking the key, or breaking IDEA, which is harder than factoring the RSA key, given current knowledge about the algorithms. I hope this answers your questions. If someone has real numbers to put in here, please update mine! -derek
participants (2)
-
Derek Atkins -
dwomack@runner.utsa.edu