Timeline for Replacement for XOR in CBC?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 27, 2018 at 9:02 | comment | added | Pedro Gimeno | I'm not "going to do that" :) it was just a random example of a cipher having $P_i$ and $C_{i-1}$ as inputs and a secret part. And yes, your method works as well. | |
| Oct 27, 2018 at 3:02 | comment | added | poncho | @PedroGimeno: if you're going to do that, why not $C_i = E_{k_1}( P_i \oplus E_{k_2}( C_{i-1} ))$ ? | |
| Oct 27, 2018 at 1:50 | comment | added | Pedro Gimeno | What if $\circ$ is a cipher with $C_{i-1}$ plus a secret key part as a key? Say for example, $C_i = E_k(P_i\oplus MD5(C_{i-1}||secret))$. Decryption would still be easy, but not without knowing the secret part. | |
| Oct 26, 2018 at 23:01 | vote | accept | Pedro Gimeno | ||
| Oct 27, 2018 at 1:40 | |||||
| Oct 26, 2018 at 21:27 | history | answered | poncho | CC BY-SA 4.0 |