Multidimensional Linear Cryptanalysis

• Published in: Journal of cryptology Vol. 32; no. 1; pp. 1 - 34
• Main Authors: Hermelin, Miia, Cho, Joo Yeon, Nyberg, Kaisa
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.01.2019; Springer Nature B.V
• Subjects: Algorithms; Approximation; Coding and Information Theory; Combinatorics; Communications Engineering; Computational Mathematics and Numerical Analysis; Computer Science; Computer simulation; Cryptography; Encryption; Goodness of fit; Independent variables; Likelihood ratio; Measurement methods; Multidimensional methods; Networks; Probability Theory and Stochastic Processes; Statistical models; Statistical tests; Key ranking; Advantage; Linear cryptanalysis; Multidimensional linear approximation; Matsui’s Algorithm 2; Matsui’s Algorithm 1; Key recovery; Goodness of fit
• ISSN: 0933-2790; 1432-1378
• DOI: 10.1007/s00145-018-9308-x

Linear cryptanalysis introduced by Matsui is a statistical attack which exploits a binary linear relation between plaintext, ciphertext and key, either in Algorithm 1 for recovering one bit of information of the secret key of a block cipher, or in Algorithm 2 for ranking candidate values for a part of the key. The statistical model is based on the expected and observed bias of a single binary value. Multiple linear approximations have been used with the goal to make the linear attack more efficient. More bits of information of the key can potentially be recovered possibly using less data. But then also more elaborated statistical models are needed to capture the joint behaviour of several not necessarily independent binary variables. Also more options are available for generalising the statistics of a single variable to several variables. The multidimensional extension of linear cryptanalysis to be introduced in this paper considers using multiple linear approximations that form a linear subspace. Different extensions of Algorithm 1 and Algorithm 2 will be presented and studied. The methods will be based on known statistical tools such as goodness-of-fit test and log-likelihood ratio. The efficiency of the different methods will be measured and compared in theory and experiments using the concept of advantage introduced by Selçuk. The block cipher Serpent with a reduced number of rounds will be used as test bed. The multidimensional linear cryptanalysis will also be compared with previous methods that use biasedness of multiple linear approximations. It will be shown in the simulations that the multidimensional method is potentially more powerful. Its main theoretical advantage is that the statistical model can be given without the assumption about statistical independence of the linear approximations.