Spectral probabilistic and statistical analysis of Markov ciphers | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2021. № 53. DOI: 10.17223/20710410/53/2

We study probabilistic models of block cipher systems in which random round keys are independent and equally distributed. They are called Markov ciphers if the sequence of round differences forms a simple homogeneous Markov chain. The elements and rows of the matrices P ^R of the transition probabilities of differences in R rounds, which are the most distant from equiprobable values for all sufficiently large R The spectral criterion proposed in 2016 by the author for testing hypotheses about random substitutions was applied to construct and calculate discrimination attacks in the model of independent two-block texts and in the new model of independent complete codebooks.