A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Reflection ciphers
2015
Designs, Codes and Cryptography
This paper investigates ciphers where the set of encryption functions is identical to the set of decryption functions, which we call reflection ciphers. Equivalently, there exists a permutation P , named the coupling permutation, such that decryption under k corresponds to encryption under P (k). We show that this coupling permutation must be an involution without fixed points. Special care has to be taken of some related-key distinguishers since, in the context of reflection ciphers, they may
doi:10.1007/s10623-015-0143-x
fatcat:anvmhignkjcmrppn7s5exwcumu