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