International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Searching for Subspace Trails and Truncated Differentials

Authors:
Gregor Leander , Horst Görtz Institute for IT-Security, Ruhr-Universität Bochum
Cihangir Tezcan , Horst Görtz Institute for IT-Security, Ruhr-Universität Bochum, Germany; Informatics Institute, Department of Cyber Security, CYDES Laboratory, and Department of Mathematics, Middle East Technical University, Ankara
Friedrich Wiemer , Horst Görtz Institute for IT-Security, Ruhr-Universität Bochum
Download:
DOI: 10.13154/tosc.v2018.i1.74-100
URL: https://tosc.iacr.org/index.php/ToSC/article/view/845
Search ePrint
Search Google
Abstract: Grassi et al. [Gra+16] introduced subspace trail cryptanalysis as a generalization of invariant subspaces and used it to give the first five round distinguisher for Aes. While it is a generic method, up to now it was only applied to the Aes and Prince. One problem for a broad adoption of the attack is a missing generic analysis algorithm. In this work we provide efficient and generic algorithms that allow to compute the provably best subspace trails for any substitution permutation cipher.
BibTeX
@article{tosc-2018-28392,
  title={Searching for Subspace Trails and Truncated Differentials},
  journal={IACR Trans. Symmetric Cryptol.},
  publisher={Ruhr-Universität Bochum},
  volume={2018, Issue 1},
  pages={74-100},
  url={https://tosc.iacr.org/index.php/ToSC/article/view/845},
  doi={10.13154/tosc.v2018.i1.74-100},
  author={Gregor Leander and Cihangir Tezcan and Friedrich Wiemer},
  year=2018
}