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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00610101
Contributor : Céline Blondeau <>
Submitted on : Thursday, July 21, 2011 - 10:01:29 AM
Last modification on : Wednesday, December 18, 2019 - 1:20:51 AM

Links full text

Identifiers

Collections

Citation

Céline Blondeau, Benoît Gérard, Jean-Pierre Tillich. Accurate estimates of the data complexity and success probability for various cryptanalyses. Designs, Codes and Cryptography, Springer Verlag, 2011, 59 (1-3), pp.3-34. ⟨10.1007/s10623-010-9452-2⟩. ⟨hal-00610101⟩

Share

Metrics

Record views

292