CryptoDB
On the Data Complexity of Statistical Attacks Against Block Ciphers (full version)
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2009-18241, title={On the Data Complexity of Statistical Attacks Against Block Ciphers (full version)}, booktitle={IACR Eprint archive}, keywords={secret-key cryptography / statistical cryptanalysis, iterated block cipher, data complexity.}, url={http://eprint.iacr.org/2009/064}, note={ celine.blondeau@inria.fr 14287 received 9 Feb 2009, last revised 12 Feb 2009}, author={Céline Blondeau and Benoît Gérard}, year=2009 }