Timeline for What encryption algorithm is context-free, deterministic and symmetric?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 23, 2017 at 6:47 | vote | accept | aggsol | ||
| Oct 20, 2017 at 10:46 | history | edited | CodesInChaos | CC BY-SA 3.0 |
added 96 characters in body
|
| Oct 20, 2017 at 10:44 | comment | added | CodesInChaos | @aggsol Unfortunately that's an area where it's very easy to subtly screw it up in a way that produces practical vulnerabilities to a CCA. Eax prime and various Caesar candidates serve as an example. At minimum you'd have to ensure that padding removal happens after the MAC validation and not before, to avoid padding oracles. I also find the way CBC treats its IV very difficult to reason about (compared to CTR). | |
| Oct 20, 2017 at 9:44 | comment | added | aggsol | Oh, wow. That is rather new and currently incoming to OpenSSL. Is there a current one? Would be a SHA-1 MAC of the message as IV with AES-CBC suffice? | |
| Oct 20, 2017 at 9:27 | history | answered | CodesInChaos | CC BY-SA 3.0 |