Abstract
In this paper we introduce the correlation matrix of a Boolean mapping, a useful concept in demonstrating and proving properties of Boolean functions and mappings. It is argued that correlation matrices are the “natural” representation for the proper understanding and description of the mechanisms of linear cryptanalysis [4]. It is also shown that the difference propagation probabilities and the table consisting of the squared elements of the correlation matrix are linked by a scaled Walsh-Hadamard transform.
Chapter PDF
Similar content being viewed by others
References
S. W. Golomb, Shift Register Sequences, Holden-Day Inc., San Francisco, 1967.
G.Z. Xiao, J.L. Massey, A Spectral Characterization of Correlation-Immune Functions, IEEE Trans. Inform. Theory, Vol. 34, No. 3, 1988, pp. 569–571
E. Biham and A. Shamir, Differential Cryptanalysis of of the Data Encryption Standard, Springer-Verlag, 1993.
M. Matsui, Linear Cryptanalysis Method for DES Cipher, Advances in Cryptology — Proceedings of Eurocrypt '93, LNCS 765, T. Helleseth, Ed., Springer-Verlag, 1993, pp. 386–397.
B. Preneel, Analysis and Design of Cryptographic Hash Functions, Doct. Dissertation K.U.Leuven, January 1993.
J. Daemen, Cipher and Hash Function Design. Strategies Based on Linear and Differential Cryptanalysis, Doct. Dissertation K.U.Leuven, March 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daemen, J., Govaerts, R., Vandewalle, J. (1995). Correlation matrices. In: Preneel, B. (eds) Fast Software Encryption. FSE 1994. Lecture Notes in Computer Science, vol 1008. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60590-8_21
Download citation
DOI: https://doi.org/10.1007/3-540-60590-8_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60590-4
Online ISBN: 978-3-540-47809-6
eBook Packages: Springer Book Archive