scholar.google.com › citations
It is shown that GOST is secure against the linear cryptanalysis after five rounds and against the differential cryptanalysis after seven rounds. The ...
Apr 4, 2001 · In this paper the linear cryptanalysis and the differential cryptanalysis of the Rus- sian 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 ...
Jun 13, 2011 · In the well known Schneier textbook written in the late 1990s we read: “Against differential and linear cryptanalysis, GOST is probably stronger.
Our research is aimed to evaluating the resistance to the method of differential cryptanalysis of GOST algorithm defined as the state standard in Russian ...
In this paper we survey some of our research on the differential cryptanalysis of GOST. GOST cipher is the official encryption stan- dard of the Russian ...
The large number of rounds and secret S-boxes makes both linear and differential cryptanalysis difficult. Its avalanche effect may be slower to occur, but it ...
The block cipher GOST was proposed in former Soviet Union in 1989. In this paper we present the first result of differential cryptanalysis of GOST with ...
May 1, 2011 · In the well known Schneier textbook we read: “Against differential and linear cryptanalysis, GOST is probably stronger than DES”, see [42]. A ...
People also ask
What is a differential cryptanalysis?
How does linear cryptanalysis work?
Bruce Schneier has written on page 334 of his famous book [29] that “Against differential and linear cryptanalysis, GOST is probably stronger than DES”.