Skip to Main content Skip to Navigation
New interface
Conference papers

Reflection Ciphers (Extended abstract)

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 en-cryption 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 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. In particular, we show that, for affine coupling permutations, the resistance to related-key distinguishers is given by some trade-off between the dimension and the covering-radius of some linear codes. Finally, as an illustration, we provide new variants of the block cipher PRINCE with key schedules corresponding to several coupling permutations.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Anne Canteaut Connect in order to contact the contributor
Submitted on : Thursday, December 3, 2015 - 9:42:25 AM
Last modification on : Tuesday, October 25, 2022 - 4:22:00 PM
Long-term archiving on: : Saturday, April 29, 2017 - 4:43:46 AM


Files produced by the author(s)


  • HAL Id : hal-01237291, version 1



Christina Boura, Anne Canteaut, Lars R. Knudsen, Gregor Leander. Reflection Ciphers (Extended abstract). Workshop on Coding and Cryptography - WCC 2015, Apr 2015, Paris, France. ⟨hal-01237291⟩



Record views


Files downloads