Linear Cryptanalysis: Key Schedules and Tweakable Block Ciphers

  • Thorsten Kranz Horst Görtz Institute for IT Security, Ruhr-Universität Bochum
  • Gregor Leander Horst Görtz Institute for IT Security, Ruhr-Universität Bochum
  • Friedrich Wiemer Horst Görtz Institute for IT Security, Ruhr-Universität Bochum
Keywords: Linear Cryptanalysis, Key Schedule, Hypothesis of Independent Round Keys, Tweakable Block Cipher

Abstract

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.

Published
2017-03-08
How to Cite
Kranz, T., Leander, G., & Wiemer, F. (2017). Linear Cryptanalysis: Key Schedules and Tweakable Block Ciphers. IACR Transactions on Symmetric Cryptology, 2017(1), 474-505. https://doi.org/10.13154/tosc.v2017.i1.474-505
Section
Articles