Searching for Subspace Trails and Truncated Differentials


Grassi et al. 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.

Mar 5, 2018 14:20
Fast Software Encryption (FSE) 2018
Bruges, Belgium
Friedrich Wiemer
Security Lead Cross-Domain ECUs
CEO and Co-Founder

My research interests include the design and analysis of symmetric primitives.