4 ms·
Quite a lot more than a few trillion.
by libeclipse 10y ago
Quite a lot more than a few trillion.
- jsudhams 10y agoIsn't brute force a chance? Should it not be "see you in next minute to few years?"
- deleted 10y ago[deleted]
- rtkwe 10y agoIt's all down to probabilities, yes our hypothetical attacker could guess your key correctly the first time or within a few years but the chances are so tiny it approaches zero for practical purposes on practical timescales.
- dmichulke 10y agoYou have to account for Moore's Law within the few trillions GP mentioned
- United857 10y agohttps://www.reddit.com/r/theydidthemath/comments/1x50xl/time_and_energy_required_to_bruteforce_a_aes256/ https://www.reddit.com/r/theydidthemath/comments/1x50xl/time... tl;dr if all the matter in the whole universe was a computer, it'd still be unlikely.
- grandsham 10y agoBruce 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 http://security.stackexchange.com/a/6149
- uxcn 10y agoIt'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_content https://en.wikipedia.org/wiki/Observable_universe#Matter_con...
- learningbot 10y ago10^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 10y agoSure it does. It just happens to necessitate our transition to Kardashev III.