|
An encrypted message between terrorists is intercepted by an intelligence agency (IA).
The IA has been given information that decoding the message is the only way to stop a nuclear attack on their country. They receive the encrypted message 15 seconds before the nuclear attack is to be launched.
A computer scientist starts up a brute force decryption program which randomly guesses at decryption keys. There are 2^1024, or
179,769,313,486,231,590,772,930,519,078,902,473,361,797,697 ,894,230,657,273,430,081,157,732,675,805,500,963,132,708,47 7,322,407,536,021,120,113,879,871,393,357,658,789,768,814,4 16,622,492,847,430,639,474,124,377,767,893,424,865,485,276, 302,219,601,246,094,119,453,082,952,085,005,768,838,150,682 ,342,462,881,473,913,110,540,827,237,163,350,510,684,586,29 8,239,947,245,938,479,716,304,835,356,329,624,224,137,216 possible keys. Those are some pretty bad odds. But he has a theory.
His computer program guesses the decryption key on the first guess, and he uses the decoded information to stop the nuclear attack. They're saved.
The other IA members stare at him, their jaws dropped to the floor, eyes wide.
Apparently, in all of the possible outcomes (other than this one), they all died instantly in a flash of nuclear fission. Ouch times 2^1024 - 1.
|