Timeline for Brute force strategy
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 14, 2021 at 19:38 | answer | added | Maarten Bodewes♦ | timeline score: 2 | |
| Feb 13, 2021 at 18:08 | history | edited | Patriot | CC BY-SA 4.0 |
minor mistakes
|
| Feb 13, 2021 at 18:00 | comment | added | kelalaka | The RSA DES challenges are nice examples. You need at least one known-plaintext to execute the attack, possibly more than one. Now, considering that you tagged CTR, are you going to execute crib-dragging on the CTR mode that requires that the $(key, IV)$ pair is used again? | |
| Feb 13, 2021 at 17:47 | comment | added | kelalaka | It seems you want to work on DES, see the historical machines on DES here and note that some of today's supercomputers can deal with less than an hour. | |
| Feb 13, 2021 at 17:47 | review | First posts | |||
| Feb 13, 2021 at 18:08 | |||||
| Feb 13, 2021 at 17:42 | history | asked | anon | CC BY-SA 4.0 |