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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Nicolas Courtois, Private Communication
Daemen, J., Rijmen, V.: The Design of Rijndael. Springer, Heidelberg (2002)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Armknecht, F., Lucks, S. (2005). Linearity of the AES Key Schedule. In: Dobbertin, H., Rijmen, V., Sowa, A. (eds) Advanced Encryption Standard – AES. AES 2004. Lecture Notes in Computer Science, vol 3373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11506447_14
Download citation
DOI: https://doi.org/10.1007/11506447_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26557-3
Online ISBN: 978-3-540-31840-8
eBook Packages: Computer ScienceComputer Science (R0)