Differential and linear cryptanalysis for 2-round SPNs
โ Scribed by Kilsoo Chun; Seungjoo Kim; Sangjin Lee; Soo Hak Sung; Seonhee Yoon
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 99 KB
- Volume
- 87
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
โฆ Synopsis
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 sharpen the known results for the 2-round SPNs.
๐ SIMILAR VOLUMES
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 a