Accurate estimates of the data complexity and success probability for various cryptanalyses

Abstract Many attacks on encryption schemes rely on statistical considerations using plaintext/ciphertext pairs to find some information on the key. We provide here simple formulae for estimating the data complexity and the success probability which can be applied to a lot of different scenarios (differential cryptanalysis, linear cryptanalysis, truncated differential cryptanalysis, etc.). Our work does not rely here on Gaussian approximation which is not valid in every setting but use instead a simple and general approximation of the binomial distribution and asymptotic expansions of the beta distribution. Keywords statistical cryptanalysis · success probability · data complexity

• Type: Journal
• Year: 2011
• Where: DCC
• Authors: Céline Blondeau, Benoît Gérard, Jean-Pierre Tillich
• Keywords: Computer Graphics, Cryptanalysis, Data Complexity, DCC 2011, Differential Cryptanalysis