[grandsham]

Bruce Schneier and others[1] have done the math on brute forcing 256 bit keys: even with a perfectly efficient computer using the least amount of energy possible, you would have to deplete the entire energy content of the Sun to just iterate over a 225 bit keyspace once, let alone do anything meaningful with those keys.

Moore's Law doesn't really factor into it.

[1]http://security.stackexchange.com/a/6149

[uxcn]

It's estimated there are 10^80 atoms [1] in the visible universe, so 2^256 is definitely a huge number. I didn't realize 256 bit brute force was nigh feasible with only a solar system.

I'm a bit surprised the quantum algorithm only gives a polynomial speedup.

[1] https://en.wikipedia.org/wiki/Observable_universe#Matter_con...

[learningbot]

10^80 = (10^3)^80/3 = 1000^80/3 = 1000^26.67

2^256 = (2^10)^25.6 = 1024^25.6

These number seem very close.

[andrewflnr]

Sure it does. It just happens to necessitate our transition to Kardashev III.