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.
Type de document :
Communication dans un congrès
Workshop on Coding and Cryptography - WCC 2015, Apr 2015, Paris, France. 〈http://wcc2015.inria.fr/〉
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01237291
Contributeur : Anne Canteaut <>
Soumis le : jeudi 3 décembre 2015 - 09:42:25
Dernière modification le : vendredi 25 mai 2018 - 12:02:05
Document(s) archivé(s) le : samedi 29 avril 2017 - 04:43:46

Fichier

wcc.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01237291, version 1

Citation

Christina Boura, Anne Canteaut, Lars Knudsen, Gregor Leander. Reflection Ciphers (Extended abstract). Workshop on Coding and Cryptography - WCC 2015, Apr 2015, Paris, France. 〈http://wcc2015.inria.fr/〉. 〈hal-01237291〉

Partager

Métriques

Consultations de la notice

311

Téléchargements de fichiers

110