Timeline for How often do brute force attacks find the password or key in a much shorter amount of time than the theoretical max?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 1, 2019 at 9:55 | comment | added | TripeHound | @jreese Yes, and you will often see this half-the-key-space average figure mentioned in security discussions. However, for a 128-bit key (2^128 possibilities), half the attempts is still 2^127, so it's still a very long time. | |
| Jan 31, 2019 at 15:35 | comment | added | cranbanan | If the key space were uniformly distributed, wouldn't that mean it should, on average, require checking only half the key space instead of all possible combinations? Like if you have 1000 keys to crack, would that mean 500 of them are likely to be cracked in the first 50% of keys generated? How is the key space distributed anyway? Anything other than uniform would be a weakness wouldn't it? | |
| Jan 31, 2019 at 15:16 | history | answered | Sefa | CC BY-SA 4.0 |