Reflection ciphers

Christina Boura, Anne Canteaut, Lars Ramkilde Knudsen, Gregor Leander

Research output: Contribution to journalJournal articleResearchpeer-review

124 Downloads (Pure)

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.
Original languageEnglish
JournalDesigns, Codes and Cryptography
Volume82
Pages (from-to)3-25
ISSN0925-1022
DOIs
Publication statusPublished - 2017

Keywords

  • Reflection ciphers
  • Involutions
  • Related-key distinguishers
  • PRINCE

Cite this

Boura, Christina ; Canteaut, Anne ; Knudsen, Lars Ramkilde ; Leander, Gregor. / Reflection ciphers. In: Designs, Codes and Cryptography. 2017 ; Vol. 82. pp. 3-25.
@article{efad9ca9a07648d3b89df090a7b2baf0,
title = "Reflection ciphers",
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.",
keywords = "Reflection ciphers, Involutions, Related-key distinguishers, PRINCE",
author = "Christina Boura and Anne Canteaut and Knudsen, {Lars Ramkilde} and Gregor Leander",
year = "2017",
doi = "10.1007/s10623-015-0143-x",
language = "English",
volume = "82",
pages = "3--25",
journal = "Designs, Codes and Cryptography",
issn = "0925-1022",
publisher = "Springer New York",

}

Reflection ciphers. / Boura, Christina ; Canteaut, Anne; Knudsen, Lars Ramkilde; Leander, Gregor.

In: Designs, Codes and Cryptography, Vol. 82, 2017, p. 3-25.

Research output: Contribution to journalJournal articleResearchpeer-review

TY - JOUR

T1 - Reflection ciphers

AU - Boura, Christina

AU - Canteaut, Anne

AU - Knudsen, Lars Ramkilde

AU - Leander, Gregor

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

KW - Reflection ciphers

KW - Involutions

KW - Related-key distinguishers

KW - PRINCE

U2 - 10.1007/s10623-015-0143-x

DO - 10.1007/s10623-015-0143-x

M3 - Journal article

VL - 82

SP - 3

EP - 25

JO - Designs, Codes and Cryptography

JF - Designs, Codes and Cryptography

SN - 0925-1022

ER -