Walsh transforms and cryptographic applications in bias computing

• Published in: Cryptography and communications Vol. 8; no. 3; pp. 435 - 453
• Main Authors: Lu, Yi, Desmedt, Yvo
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.07.2016
• Subjects: Circuits; Coding and Information Theory; Communications Engineering; Computer Science; Data Structures and Information Theory; Information and Communication; Mathematics of Computing; Networks; Walsh transform; 06E30; 68Q25; Piling-up lemma; Linear cryptanalysis; Bias analysis; Maximum entropy principle; 94A60; 62E15
• ISSN: 1936-2447; 1936-2455
• DOI: 10.1007/s12095-015-0155-4

Walsh transform is used in a wide variety of scientific and engineering applications, including bent functions and cryptanalytic optimization techniques in cryptography. In linear cryptanalysis, it is a key question to find a good linear approximation, which holds with probability (1+ d )/2 and the bias d is large in absolute value. Lu and Desmedt ( 2011 ) take a step toward answering this key question in a more generalized setting and initiate the work on the generalized bias problem with linearly-dependent inputs. In this paper, we give fully extended results. Deep insights on assumptions behind the problem are given. We take an information-theoretic approach to show that our bias problem assumes the setting of the maximum input entropy subject to the input constraint. By means of Walsh transform, the bias can be expressed in a simple form. It incorporates Piling-up lemma as a special case. Secondly, as application, we answer a long-standing open problem in correlation attacks on combiners with memory. We give a closed-form exact solution for the correlation involving the multiple polynomial of any weight for the first time . We also give Walsh analysis for numerical approximation. An interesting bias phenomenon is uncovered, i.e., for even and odd weight of the polynomial, the correlation behaves differently. Thirdly, we introduce the notion of weakly biased distribution, and study bias approximation for a more general case by Walsh analysis. We show that for weakly biased distribution, Piling-up lemma is still valid. Our work shows that Walsh analysis is useful and effective to a broad class of cryptanalysis problems.