Open AccessLinear Cryptanalysis: Key Schedules and Tweakable Block Ciphers
Author(s) -
Thorsten M. Kranz,
Gregor Leander,
Friedrich Wiemer
Publication year - 2017
Publication title -
iacr transaction on symmetric cryptology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.715
H-Index - 10
ISSN - 2519-173X
DOI - 10.46586/tosc.v2017.i1.474-505
Subject(s) - linear cryptanalysis , key schedule , boomerang attack , impossible differential cryptanalysis , block cipher , differential cryptanalysis , s box , computer science , higher order differential cryptanalysis , cryptanalysis , algorithm , theoretical computer science , cryptography
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.