Name
Abstract | ||
|---|---|---|
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 study the necessary properties for this coupling permutation. Special care has to be taken of some related-key distinguishers since, in the context of reflection ciphers, they may provide attacks in the single-key setting. We then derive some criteria for constructing secure reflection ciphers and analyze the security properties of different families of coupling permutations. Finally, we concentrate on the case of reflection block ciphers and, as an illustration, we provide concrete examples of key schedules corresponding to several coupling permutations, which lead to new variants of the block cipher prince. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s10623-015-0143-x | Des. Codes Cryptography |
Keywords | DocType | Volume |
Reflection ciphers,Involutions,Related-key distinguishers,prince,94A60 | Journal | 82 |
Issue | Citations | PageRank |
1-2 | 0 | 0.34 |
References | Authors | |
10 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christina Boura | 1 | 0 | 1.01 |
| Anne Canteaut | 2 | 92 | 14.03 |
| Lars R. Knudsen | 3 | 752 | 135.34 |
| Gregor Leander | 4 | 1287 | 77.03 |