Paper 2016/493

Partition-Based Trapdoor Ciphers

Arnaud Bannier, Nicolas Bodin, and Eric Filiol

Abstract

This paper deals with block ciphers embedding a trapdoor which consists to map a partition of the plaintext space to a partition of the ciphertext space. In a first part, this issue is reduced to the study of the S-boxes of the cipher satisfying a few criteria. Then, differential and linear properties of such S-boxes are assessed and an algorithm to build optimal S-boxes is provided. Finally, these primitives are used to design a small trapdoor cipher resistant to linear and differential cryptanalysis. This trapdoor allows to recover the $\kappa$-bit master key with only one plaintext/ciphertext pair and an effort of $2^{\frac{\kappa}{2}}$ encryptions.

Note: Typos corrected. Minor corrections and revision to improve readability

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint. MINOR revision.
Keywords
Cryptanalysisblock cipherSubstitution-Permutation NetworkTrapdoorPartitionS-box
Contact author(s)
bannier @ esiea fr
History
2016-08-26: revised
2016-05-22: received
See all versions
Short URL
https://ia.cr/2016/493
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/493,
      author = {Arnaud Bannier and Nicolas Bodin and Eric Filiol},
      title = {Partition-Based Trapdoor Ciphers},
      howpublished = {Cryptology ePrint Archive, Paper 2016/493},
      year = {2016},
      note = {\url{https://eprint.iacr.org/2016/493}},
      url = {https://eprint.iacr.org/2016/493}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.