Timeline for Time taken for a brute force attack on a key size of 64-bits
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 1 at 8:37 | answer | added | Guanyuming He | timeline score: 2 | |
| Apr 16, 2016 at 21:15 | history | tweeted | twitter.com/StackCrypto/status/721447000219262977 | ||
| Apr 15, 2016 at 9:38 | answer | added | Maarten Bodewes♦ | timeline score: 11 | |
| Apr 15, 2016 at 5:23 | comment | added | fgrieu♦ | Hints: brute force attack is trying keys, until finding one that matches. We can try them by increasing order. Trying involves one encryption with the key tried, and then a comparison of comparably small cost, and (if there's a match, that is, rarely) some confirmation operation. If a key has $b$ bits, how many possible keys are there? What's the time to try them all at a rate of $r$ keys per second? For the average time, you can compute the average of the exact time over all possible key values, or use a well-known approximation. | |
| Apr 15, 2016 at 0:47 | history | edited | Richie Frame | CC BY-SA 3.0 |
formatting
|
| Apr 15, 2016 at 0:39 | review | First posts | |||
| Apr 15, 2016 at 11:33 | |||||
| Apr 15, 2016 at 0:36 | history | asked | Scott M | CC BY-SA 3.0 |