Linearity of the AES Key Schedule

  • Frederik Armknecht
  • Stefan Lucks
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3373)

Abstract

The AES key schedule can almost be described as collection of 32 linear feedback shift registers LFSRs, working in parallel. This implies that for related keys, i.e., pairs of unknown keys with known differences, one can in part predict the differences of the individual round keys. Such a property has been used (but not explained in detail) by Ferguson et al. [3] for a related key attack on a 9-round variant of the AES (with 256-bit keys). In the current paper, we study the propagation of (known) key differences in the key schedule for all three key sizes of the AES.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Nicolas Courtois, Private CommunicationGoogle Scholar
  2. 2.
    Daemen, J., Rijmen, V.: The Design of Rijndael. Springer, Heidelberg (2002)MATHGoogle Scholar
  3. 3.
    Ferguson, N., Kelsey, J., Lucks, S., Schneier, B., Stay, M., Wagner, D., Whiting, D.: Improved Crypanalysis of Rijndael. In: Schneier, B. (ed.) FSE 2000. LNCS, vol. 1978, p. 213. Springer, Heidelberg (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Frederik Armknecht
    • 1
  • Stefan Lucks
    • 1
  1. 1.Theoretische InformatikUniversität MannheimMannheimGermany

Personalised recommendations