DIFFERENTIAL CRYPTANALYSIS OF GOST ENCRYPTION ALGORITHM
In this article we explore the resistance of the GOST 28147-89 algorithm to the attack based on differential cryptanalysis. As the result of our research, we have found out that there is a number of S-boxes with weak properties with respect to differential cryptanalysis. The use of such elements in GOST allows obtaining features that have a fairly high probability that can be used to carry out attacks. So, if we use the same weak block replacement, the probability characteristics for the 32 rounds of GOST can reach 2 -25, which makes it relatively easy to get the right pair of texts for analysis.