Rigorous upper bounds on data complexities of block cipher cryptanalysis

• Main Authors: Samajder Subhabrata, Sarkar Palash
• Format: Article
• Language: English
• Published: De Gruyter 2017-10-01
• Series: Journal of Mathematical Cryptology
• Subjects: block cipher; linear cryptanalysis; differential cryptanalysis; log-likelihood ratio test; hypothesis testing; chernoff bound; hoeffding’s inequality; 94a60; 11t71; 68p25; 62p99
• Online Access: https://doi.org/10.1515/jmc-2016-0026
• ISSN: 1862-2976; 1862-2984

Statistical analysis of symmetric key attacks aims to obtain an expression for the data complexity which is the number of plaintext-ciphertext pairs needed to achieve the parameters of the attack. Existing statistical analyses invariably use some kind of approximation, the most common being the approximation of the distribution of a sum of random variables by a normal distribution. Such an approach leads to expressions for data complexities which are inherently approximate. Prior works do not provide any analysis of the error involved in such approximations. In contrast, this paper takes a rigorous approach to analyzing attacks on block ciphers. In particular, no approximations are used. Expressions for upper bounds on the data complexities of several basic and advanced attacks are obtained. The analysis is based on the hypothesis testing framework. Probabilities of type-I and type-II errors are upper bounded by using standard tail inequalities. In the cases of single linear and differential cryptanalysis, we use the Chernoff bound. For the cases of multiple linear and multiple differential cryptanalysis, Hoeffding bounds are used. This allows bounding the error probabilities and obtaining expressions for data complexities. We believe that our method provides important results for the attacks considered here and more generally, the techniques that we develop should have much wider applicability.