Searching for Subspace Trails and Truncated Differentials
AbstractGrassi 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.
Copyright (c) 2018 Gregor Leander, Cihangir Tezcan, Friedrich Wiemer
This work is licensed under a Creative Commons Attribution 4.0 International License.