Free Republic
Browse · Search
News/Activism
Topics · Post Article

To: Straight Vermonter
A 516 digit key can be cracked using this computerized “brute force” method. [...] However, increase the key to 768 characters, and it takes about 6,600 times longer to crack it. Go to key size of 1024, and it takes 1,500 times longer than the 768 character key. Go to a 2048 key size and it takes a billion times longer than a 1024 character long key. PGP can use a 1024 character key, and many users go for the larger key for obvious reasons.

Someone needs to teach this reporter some math. The actual difficulty figures for a brute force crack are:

A 768-bit key takes 7.24x1075 times as long to crack as a 516-bit key (that's a 7 followed by *74* zeros).

A 1024-bit key takes 1.16x1077 times as long to crack as a 768-bit key (1 followed by 76 zeros).

A 2048-bit key takes 1.80x10308 times as long to crack as a 1024-bit key (about 2 followed by 307 zeros).

In each case the appropriate figure is 2(B2-B1), where B1 is the number of bits in the smaller key, and B2 is the number of bits in the larger key.

I don't know where in the hell the reporter got his figures from, but they're too small by enormous orders of magnitude.

If every single atom in the universe were a computer a trillion times faster than the fastest computer today, and ran for a trillion years, you still wouldn't have enough computer power to crack a single 2048-bit key by brute force.

12 posted on 08/04/2004 11:55:55 PM PDT by Ichneumon ("...she might as well have been a space alien." - Bill Clinton, on Hillary, "My Life", p. 182)
[ Post Reply | Private Reply | To 1 | View Replies ]


To: Ichneumon
In each case the appropriate figure is 2(B2-B1), where B1 is the number of bits in the smaller key, and B2 is the number of bits in the larger key.

It's actually much less than that. The security of a key against brute force attack is proportional to the number of possible keys, not the size of a key. For RSA keys, most members of the keyspace are not valid keys since RSA keys are based on large prime numbers. An n-bit RSA key is nowhere near as secure as an n-bit conventional cipher key.
15 posted on 08/05/2004 12:05:11 AM PDT by ScuzzyTerminator
[ Post Reply | Private Reply | To 12 | View Replies ]

To: Ichneumon
you still wouldn't have enough computer power to crack a single 2048-bit key by brute force.

"I think there is a world market for about five computers." -IBM founder Thomas Watson Sr.

18 posted on 08/05/2004 12:08:45 AM PDT by Jeff Gordon (LWS - Legislating While Stupid. Someone should make this illegal.)
[ Post Reply | Private Reply | To 12 | View Replies ]

To: Ichneumon

"A 1024-bit key takes 1.16x10^77 times as long to crack as a 768-bit key (1 followed by 76 zeros)."

That would be a 1 followed by 77 zeros. Just like 1 times 10^2 is a one followed by 2 zeros.


40 posted on 08/05/2004 1:30:14 PM PDT by Flightdeck (Procrastinate later)
[ Post Reply | Private Reply | To 12 | View Replies ]

To: Ichneumon
If every single atom in the universe were a computer a trillion times faster than the fastest computer today, and ran for a trillion years, you still wouldn't have enough computer power to crack a single 2048-bit key by brute force.

I call keys like that 'heat death' keys, because they'll take longer to decrypt than the ultimate fate of the universe.

47 posted on 08/05/2004 6:52:10 PM PDT by zeugma (The Great Experiment is over and the Constitution is dead.)
[ Post Reply | Private Reply | To 12 | View Replies ]

Free Republic
Browse · Search
News/Activism
Topics · Post Article


FreeRepublic, LLC, PO BOX 9771, FRESNO, CA 93794
FreeRepublic.com is powered by software copyright 2000-2008 John Robinson