Word generator

[snippsat]

Off topic: DeaD_EyE, the XKCD solution was exploited over four years ago. Daily Mail has a good article about it: http://www.dailymail.co.uk/sciencetech/a...-hour.html.

The article is bullshit and do not exploited XKCD solution.
They where cracking MD5,today and also back then most encryption uses at least 256 bits and Advanced Encryption Standard (AES)

So can calculate how long time it will take to brute force correct horse battery staple with 128-bit AES.
It has a password entropy of 104.2 bits.
There GPU cluster they used can make 350 billion guesses a second.

Can of course using Python for calculation

>>> # AES 128 has this many combinations 
>>> 2 ** 128
340282366920938463463374607431768211456
# entropy 104
>>> 2 ** 104
20282409603651670423947251286016

So with 2^104 give this 20282409603651670423947251286016 combination.
350 billion guesses a second.
So need to find number of second in a year:
Can you namedtuple to make it look nicer.

>>> from collections import namedtuple
>>> t = namedtuple('t', 'days hours minutes seconds')
>>> time = t(days=365, hours=24, minutes=60, seconds=60)
>>> time.days * time.hours * time.minutes * time.seconds
31536000

There are 31536000 seconds in a year.
So how many keys can be brute forced be with 350 billion guesses a second in a year.

>>> 350000000000 * 31536000
11037600000000000000

Now can calculate how long time it take to brute force correct horse battery staple with 128-bit AES.

>>> 2 ** 104 / 11037600000000000000
1837574255603.7246

Now can give result to WolframAlpha
Dos not look for waiting for a result  

Output:
Comparisons as age:
≈ 130 × universe age (≈ 14 Gyr )
≈ 400 × age of the sun (≈ 4.57 billion yr )
≈ 410 × age of the earth (≈ 4.5 billion yr ) 

Brute-force_attack

AES permits the use of 256-bit keys. Breaking a symmetric 256-bit key by brute force requires 2128 times more computational power than a 128-bit key. 50 supercomputers that could check a billion billion (1018) AES keys per second (if such a device could ever be made) would, in theory, require about 3×1051 years to exhaust the 256-bit key space.