Timeline for how to obtain the plaintext in counter mode using the AES block cipher
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 15, 2017 at 12:16 | comment | added | CodesInChaos |
the PSI working group congratulates you for solving this exercise. It was easy, right? and encrypting texts with counter mode is normally just fine, unless you do not take a fre
|
|
| Dec 9, 2017 at 22:36 | comment | added | CodesInChaos | hint: "working group", "you for solving this" and "It was easy, right?" might be part of the solution. | |
| Dec 9, 2017 at 19:28 | answer | added | hprid | timeline score: 3 | |
| Dec 9, 2017 at 13:40 | comment | added | Squeamish Ossifrage | The best you can learn about the $i^\mathit{th}$ bit position in one plaintext is only as good as you know about the $i^\mathit{th}$ bit position in the other plaintext. If you have a probabilistic model for English sentences, that may help you, of course, to guess the two sentences given their xor. But nothing about the cryptography will inform you about bit positions you don't already know something about. | |
| Dec 9, 2017 at 12:55 | review | First posts | |||
| Dec 9, 2017 at 17:32 | |||||
| Dec 9, 2017 at 12:50 | history | asked | Julia | CC BY-SA 3.0 |