Statistical and Algebraic Properties of DES

Fauskanger, Stian; Semaev, Igor

doi:10.1007/978-3-319-38898-4_6

Cited by 1 publication

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We transform the expression for Pr(x 1 = A 2 , A 15 , A 16 ) by introducing new variables and applying those properties. We get the probability depends on k, k 15 such that 7,9,11,13…”

Section: Multinomial Distributions For 14-round Desmentioning

confidence: 99%

See 1 more Smart Citation

Separable Statistics and Multidimensional Linear Cryptanalysis

Fauskanger

Semaev

2018

ToSC

Self Cite

View full text Add to dashboard Cite

Multidimensional linear cryptanalysis of block ciphers is improved in this work by introducing a number of new ideas. Firstly, formulae is given to compute approximate multidimensional distributions of the encryption algorithm internal bits. Conventional statistics like LLR (Logarithmic Likelihood Ratio) do not fit to work in Matsui’s Algorithm 2 for large dimension data, as the observation may depend on too many cipher key bits. So, secondly, a new statistic which reflects the structure of the cipher round is constructed instead. Thirdly, computing the statistic values that will fall into a critical region is presented as an optimisation problem for which an efficient algorithm is suggested. The algorithm works much faster than brute forcing all relevant key bits to compute the statistic. An attack for 16-round DES was implemented. We got an improvement over Matsui’s attack on DES in data and time complexity keeping success probability the same. With 241.81 plaintext blocks and success rate 0.83 (computed theoretically) we found 241.46 (which is close to the theoretically predicted number 241.81) key-candidates to 56-bit DES key. Search tree to compute the statistic values which fall into the critical region incorporated 245.45 nodes in the experiment and that is at least theoretically inferior in comparison with the final brute force. To get success probability 0.85, which is a fairer comparison to Matsui’s results, we would need 241.85 data and to brute force 241.85 key-candidates. That compares favourably with 243 achieved by Matsui.

show abstract

“…We transform the expression for Pr(x 1 = A 2 , A 15 , A 16 ) by introducing new variables and applying those properties. We get the probability depends on k, k 15 such that 7,9,11,13…”

Section: Multinomial Distributions For 14-round Desmentioning

confidence: 99%

“…Similar ideas were earlier used to compute joint probability distributions of some particular bits and study how those distributions depend on the cipher key for DES in [5,9] and for PRESENT in [8]. Those methods are based on a number of heuristic assumptions and simplifications.…”

Section: Introductionmentioning

confidence: 99%