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.
Author supplied keywords
Cite
CITATION STYLE
Daemen, J., Govaerts, R., & Vandewalle, J. (1995). Correlation matrices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1008, pp. 275–285). Springer Verlag. https://doi.org/10.1007/3-540-60590-8_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
