Cryptology ePrint Archive: Report 2009/064
On the Data Complexity of Statistical Attacks Against Block Ciphers (full version)
Céline Blondeau and Benoît Gérard
Abstract: Many attacks on iterated block ciphers rely on statistical considerations using plaintext/ciphertext pairs to distinguish some part of the cipher from a random permutation. We provide here a simple formula for estimating the amount of plaintext/ciphertext pairs which is needed for such distinguishers and which applies to a lot of different scenarios (linear cryptanalysis, differential-linear cryptanalysis, differential/truncated differential/impossible differential cryptanalysis). The asymptotic data complexities of all these attacks are then derived. Moreover, we give an efficient algorithm for computing the data complexity accurately.
Category / Keywords: secret-key cryptography / statistical cryptanalysis, iterated block cipher, data complexity.
Date: received 9 Feb 2009, last revised 12 Feb 2009
Contact author: celine blondeau at inria fr
Available format(s): PDF | BibTeX Citation
Version: 20090212:141933 (All versions of this report)
Short URL: ia.cr/2009/064
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]