Searching for Subspace Trails and Truncated Differentials

  • 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
Keywords: Subspace Trail Cryptanalysis, Truncated Differentials, Tools

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.
Published
2018-03-01
How to Cite
Leander, G., Tezcan, C., & Wiemer, F. (2018). Searching for Subspace Trails and Truncated Differentials. IACR Transactions on Symmetric Cryptology, 2018(1), 74-100. https://doi.org/10.13154/tosc.v2018.i1.74-100
Section
Articles