1 |
On Thursday 26 June 2008, Sebastian Wiesner wrote: |
2 |
> Alan McKinnon <alan.mckinnon@×××××.com> at Thursday 26 June 2008, |
3 |
> 10:54:43 |
4 |
> |
5 |
> > The calculation is quite simple - measure how quickly a specific |
6 |
> > computer can match keys. Divide this into the size of the keyspace. |
7 |
> > The average time to brute force a key is half that value. AFAIK |
8 |
> > this still averages out at enormous numbers of years, even at |
9 |
> > insane calculation rates like what RoadRunner can achieve. |
10 |
> |
11 |
> According to Wikipedia RoadRunner is designed for 1.7 petaflops in |
12 |
> peak. Assuming for the sake of simplicity, that decryption can be |
13 |
> performed within a single flop: |
14 |
> |
15 |
> (2^256) / (1.7 * 10^15) / 2 ~= 3.5 * 10^61 |
16 |
> |
17 |
> In years: |
18 |
> |
19 |
> 3.5 * 10^61 / 3600 / 24 / 356 ~= 10^54 |
20 |
> |
21 |
> Correct me if I'm wrong, but it seems impossible to me, to reduce |
22 |
> this get the required amount somewhere near to the life time of a |
23 |
> human being ;) |
24 |
|
25 |
Even with your ultra-liberal assumptions, it still comes out to: |
26 |
|
27 |
1000000000000000000000000000000000000 |
28 |
|
29 |
times longer than the entire universe is believed to have existed thus |
30 |
far (14 billion years). That is an unbelievable stupendously long |
31 |
period of time. Yeah, I'd agree that brute force is utterly unfeasible |
32 |
as a vector of attack. Not even the almighty NSA could ever pull that |
33 |
one off as there simply aren't enough atoms in the universe to make a |
34 |
supercomputer big enough. |
35 |
|
36 |
Numbers don't lie. |
37 |
|
38 |
-- |
39 |
Alan McKinnon |
40 |
alan dot mckinnon at gmail dot com |
41 |
|
42 |
-- |
43 |
gentoo-user@l.g.o mailing list |