Multidimensional Meet-in-the-Middle Attack and Its Applications to KATAN32/48/64
Bo Zhu, Guang Gong · 2011
This paper investigates a new approach to analyze symmetric ciphers by guessing intermediate states and dividing algorithms to consecutive sub-ciphers. It is suitable for ciphers with simple key schedules and block sizes smaller than key lengths. A thorough theoretical analysis of this multidimensional method is given, and new attacks on the block cipher family KATAN are proposed by applying this method, which can attack 175-round KATAN32, 130round KATAN48 and 112-round KATAN64 faster than exhaustive key search.