cantab |
03-26-2010 12:02 PM |
Quote:
Originally Posted by newbiesforever
(Post 3913453)
A hacker would have all the time he or she wanted to chip away at it.
|
He's gonna need all the time. John Callas, of PGP corporation, wrote:
Quote:
Burt Kaliski first came up with this characterization, and if he had a nickel for every time I tell it, he could buy a latte or three.
Imagine a computer that is the size of a grain of sand that can test keys against some encrypted data. Also imagine that it can test a key in the amount of time it takes light to cross it. Then consider a cluster of these computers, so many that if you covered the earth with them, they would cover the whole planet to the height of 1 meter. The cluster of computers would crack a 128-bit key on average in 1,000 years.
|
And that's a 128 bit key. Most ciphers now use 256 bits - which isn't twice as strong, it's a hundred trillion trillion trillion times stronger. And there's always 'cascade' encryption to further lengthen the key as well as insure against any one algorithm having its security reduced.
Since you will probably bring up quantum computers - currently it's though they will only reduce the security to half the key length. So a quantum computer will have as much trouble breaking a 512 bit key as a classical computer has breaking a 256 bit one.
If someone accesses encrypted data, it will almost certainly be because they obtain the password from you, or they hack into the computer you use to work on the encrypted data.
|