Timeline for Bruteforcing blowfish
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 8, 2014 at 10:15 | vote | accept | randor | ||
| Oct 8, 2014 at 10:15 | |||||
| Oct 7, 2014 at 15:16 | comment | added | Desthro | 128-bit keys could be broken by such a 'universal' computer, as it would have an unimaginable computational power. Example: If there was one computer operating at one attempt per second per cubic mile in the -known- universe, you would have ~8.3*10^70 attempts per second, and the total keys for 128-bit keys is ~3.4*10^38, so it'd be cracked in short order. But for any computer that we can manufacture, you are right, it would take an endless amount of time. (256-bit keys are another story!) | |
| Oct 3, 2014 at 21:28 | comment | added | Mark | For most symmetric-key algorithms, a key size of 128 bits is adequate protection against brute force: even if the entire universe were turned into the most efficient computer possible, it would be unable to try every key before heat death. Asymmetric cyphers require longer keys, because there are mathematical restrictions on what values a key can have (eg. "key must be a pair of prime numbers"). | |
| Oct 3, 2014 at 15:46 | history | answered | Desthro | CC BY-SA 3.0 |