Timeline for Key length and message length in AES and perfect secrecy if plaintext length <= key length
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 8, 2020 at 18:44 | vote | accept | tau | ||
| Feb 8, 2020 at 18:27 | comment | added | kelalaka | @tau updated the last part. I hope that it is more clear, now. | |
| Feb 8, 2020 at 18:26 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Feb 8, 2020 at 17:52 | comment | added | tau | @kelalaka that makes sense, but why is there no guarantee in AES? what step in AES ruins any guarantee? | |
| Feb 8, 2020 at 17:45 | comment | added | kelalaka | @tau added an answer for <= part in the answer. OTP is simple but requires as many keys as plaintext that is hard to reach. Therefore, we work on computational secrecy. To achieve this one way is SPN bases block ciphers like AES. To achieve confusion diffusion AES uses the matrix row/column shifts and key x-oring round keys/. | |
| Feb 8, 2020 at 17:40 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Feb 8, 2020 at 17:27 | comment | added | tau | @kelalaka thank you for the detailed answer! i am interested in the difference between AES and OTP when the plaintext length <= key length. it sounds like the confusion diffusion part of the AES algorithm (the matrix row/column shifts) is what separates it from a one time pad. is that correct? or is there more to it, like XORing the round keys? thanks again! | |
| Feb 8, 2020 at 14:42 | comment | added | Maarten Bodewes♦ | I'm guessing that the writer meant to ask is that if the key is as large or larger than the plaintext, then why can AES be distinguished from a perfect cipher? But I may be wrong about that, hard to tell. | |
| Feb 8, 2020 at 12:45 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Feb 8, 2020 at 11:25 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Feb 8, 2020 at 11:08 | history | answered | kelalaka | CC BY-SA 4.0 |