Linear Cryptanalysis: Key Schedules and Tweakable Block Ciphers
This paper serves as a systematization of knowledge of linear cryptanalysis and provides novel insights in the areas of key schedule design and tweakable block ciphers. We examine in a step by step manner the linear hull theorem in a general and consistent setting. Based on this, we study the influence of the choice of the key scheduling on linear cryptanalysis, a – notoriously difficult – but important subject. Moreover, we investigate how tweakable block ciphers can be analyzed with respect to linear cryptanalysis, a topic that surprisingly has not been scrutinized until now.
Copyright (c) 2017 Thorsten Kranz, Gregor Leander, Friedrich Wiemer
This work is licensed under a Creative Commons Attribution 4.0 International License.