Timeline for How to design a reversible shifted XOR with an S-box?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 3 at 17:55 | vote | accept | nalzok | ||
| May 2 at 21:57 | comment | added | bk2204 | As long as the S-box is a permutation, it should be. That's because in this case, the operation is the inverse of itself, and it will operate correctly as long as the bits that are the input to it are unchanged. | |
| May 2 at 5:59 | comment | added | nalzok | Thanks for the help! In general, is the "shifted XOR with an S-box" operation always invertible as long as there is no overlap between the bits used in S-box lookup (i.e. lower 4 bits) and the bits being XOR'ed (i.e. upper 4 bits)? I cannot see why that's the case. | |
| May 2 at 0:09 | history | answered | bk2204 | CC BY-SA 4.0 |