Linear Cryptanalysis: Key Schedules and Tweakable Block Ciphers

Authors

  • Thorsten Kranz Horst Görtz Institute for IT Security, Ruhr-Universität Bochum, Bochum, Germany
  • Gregor Leander Horst Görtz Institute for IT Security, Ruhr-Universität Bochum, Bochum, Germany
  • Friedrich Wiemer Horst Görtz Institute for IT Security, Ruhr-Universität Bochum, Bochum, Germany

DOI:

https://doi.org/10.13154/tosc.v2017.i1.474-505

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.

Downloads

Published

2017-03-08

Issue

Volume 2017, Issue 1

Section

Articles

License

Copyright (c) 2017 Thorsten Kranz, Gregor Leander, Friedrich Wiemer

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

Linear Cryptanalysis: Key Schedules and Tweakable Block Ciphers. (2017). IACR Transactions on Symmetric Cryptology, 2017(1), 474-505. https://doi.org/10.13154/tosc.v2017.i1.474-505