Linear and differential cryptanalysis of Russian GOST
VV Shorin, VV Jelezniakov, EM Gabidulin - Electronic Notes in Discrete …, 2001 - Elsevier
In this paper the linear cryptanalysis and the differential cryptanalysis of the Russian GOST
encryption algorithm are carried out. It is shown that GOST is secure against the linear
cryptanalysis after five rounds and against the differential cryptanalysis after seven rounds.
The differential analysis algorithm of the three round GOST is given. Also criteria for
selection of the substitution boxes with provable security against linear cryptanalysis are
given.
encryption algorithm are carried out. It is shown that GOST is secure against the linear
cryptanalysis after five rounds and against the differential cryptanalysis after seven rounds.
The differential analysis algorithm of the three round GOST is given. Also criteria for
selection of the substitution boxes with provable security against linear cryptanalysis are
given.
Showing the best result for this search. See all results