Timeline for Rounds in cryptography
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 2, 2014 at 23:48 | comment | added | Nova | @user18550: If this has answered your question, please mark it as right answer. Thank you. :) | |
| S Dec 2, 2014 at 22:26 | history | suggested | flashbang | CC BY-SA 3.0 |
Clearing up wording
|
| Dec 2, 2014 at 21:27 | review | Suggested edits | |||
| S Dec 2, 2014 at 22:26 | |||||
| Dec 1, 2014 at 12:24 | history | edited | Maarten Bodewes♦ | CC BY-SA 3.0 |
added 2 characters in body
|
| Dec 1, 2014 at 12:22 | comment | added | Maarten Bodewes♦ | In other words, if the attack is of an order too large to be practical, it is only shown to be correct mathematically. If you can make it mathematically likely or provable that you require less operations than brute force to retrieve key / plaintext information then you don't actually need to perform the attack to show a block cipher is broken. | |
| Nov 30, 2014 at 6:31 | history | answered | Nova | CC BY-SA 3.0 |