In the article 211 some proofs of results about GOST security against differential and linear cryptanalysis obtained by V. Shorin and others are discussed in detail (see [19, 20] in 211). But it should be remarked that these works contain some rough mistakes and their results could not be considered as scientifically grounded. In particular authors have analysed an effectiveness of linear approximation of addition modulo 2^32 in  under faulty assumption (p.6) that “the best approximation of the i-th bit of result is the sum mod 2 of the i-th bit of the values”. In general, the arguments in [19, 20] are mostly heuristic and don’t satisfy modern criteria for mathematical ground for security proof of block ciphers.
It seems that the detailed analysis of the GOST security against linear and differential cryptanalysis needs a great amount of further investigations.