Alan McKinnon wrote:
The calculation is quite simple - measure how quickly a specific computer can match keys. Divide this into the size of the keyspace. The average time to brute force a key is half that value. AFAIK this still averages out at enormous numbers of years, even at insane calculation rates like what RoadRunner can achieve.
256 bit keys. The 115792089237316195423570985008687907853269984665640564039457584007913129639936 keys are quite a lot to check (although, if all the atoms in the universe [estimated 10^78] were to test 1 key/sec, it'd only take about 0.1157920892 seconds). However.. 512 bit keys with all the atoms testing a trillion keys/second would take about (2^512)/(10^78)/60/60/24/(36525/100)/(10^12) or 4.2486779507765473608e56 years..
I submit that brute forcing an AES key of reasonably length is currently impossible in an amount of time that would matter to the human race.
kashani -- gentoo-user@lists.gentoo.org mailing list
