In this paper, we examine the security of block ciphers referred to as substitution-permutation networks (SPNs). When the SPN has 2-round, we obtain an upper bound on the maximum differential probability. We also obtain an upper bound on the maximum linear hull probability. Our results extend and sh
Linear and Differential Cryptanalysis of Russian GOST
โ Scribed by Vitaly V. Shorin; Vadim V. Jelezniakov; Ernst M. Gabidulin
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 470 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper the linear cryptanalysis and the di erential cryptanalysis of the Russian GOST encryption algorithm are carried out. It is shown that GOST is secure against the linear cryptanalysis after ve rounds and against the di erential cryptanalysis after seven rounds. The di erential 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.
๐ SIMILAR VOLUMES
In this paper we investigate the strength of the secret-key algorithm RC5 proposed by Ron Rivest. The target version of RC5 works on words of 32 bits, has 12 rounds and a user-selected key of 128 bits. Kaliski and Yin estimated the strength of RC5 by differential and linear cryptanalysis. They conje