Abstract
In a linear cryptanalysis attack, several assumptions are made by the attacker. One of them is that the threefold sums used in the attack are independent. This allows one to apply then the Piling-up Lemma to them. According to this lemma, the imbalance of a sum modulo 2 of independent, binary-valued random variables is equal to the product of their imbalances. It is shown here that in some cases, both quantities can differ considerably for dependent random variables, but that they are almost equal for virtually all binary-valued random variables when the sample space on which these are defined is large enough.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Carlo Harpes, Cryptanalysis of Iterated Block Ciphers, Vol. 7 of ETH Series in Information Processing, Ed. J.L. Massey, Hartung-Gorre Verlag, Konstanz, 1996. ISBN 3-89649-079-6.
Carlo Harpes, Gerhard G. Kramer, and James L. Massey, “A generalization of linear cryptanalysis and the applicability of Matsui’s piling-up lemma”, in Advances in Cryptology-Eurocrypt’95, Lecture Notes in Computer Science 921, pp. 24–38, Springer 1995. ISBN 3-540-59409-4.
Zsolt Kukorelly, On The Validity of Some Hypotheses Used in Linear Cryptanalysis, Vol. 13 of ETH Series in Information Processing, Ed. J.L. Massey, Hartung-Gorre Verlag, Konstanz, 1999. ISBN 3-89649-470-8.
Mitsuru Matsui, “Linear cryptanalysis method for DES cipher”, in Advances in Cryptology-Eurocrypt’93, Lecture Notes in Computer Science 765, pp. 386–397, Springer 1993. ISBN 3-540-57600-2.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kukorelly, Z. (1999). The Piling-Up Lemma and Dependent Random Variables. In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_22
Download citation
DOI: https://doi.org/10.1007/3-540-46665-7_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66887-9
Online ISBN: 978-3-540-46665-9
eBook Packages: Springer Book Archive