|
Problemy Peredachi Informatsii, 2008, Volume 44, Issue 3, Pages 105–127
(Mi ppi1283)
|
|
|
|
This article is cited in 7 scientific papers (total in 7 papers)
Information Protection
On Quadratic Approximations in Block Ciphers
N. N. Tokareva Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Abstract:
We consider quadratic approximations (of Boolean functions) of a special form and their potential applications in block cipher cryptanalysis. We show that the use of $k$-bent functions as ciphering functions extremely increases the resistance of ciphers to such approximations. We consider examples of $k$-bit permutations recommended for use in S-boxes of the algorithms GOST 28147-89, DES, and $s^3\mathrm{DES}$; we show that in almost all cases there exist more probable (than linear) quadratic relations of a special form on input and output bits of these permutations.
Received: 08.02.2008 Revised: 09.04.2008
Citation:
N. N. Tokareva, “On Quadratic Approximations in Block Ciphers”, Probl. Peredachi Inf., 44:3 (2008), 105–127; Problems Inform. Transmission, 44:3 (2008), 266–286
Linking options:
https://www.mathnet.ru/eng/ppi1283 https://www.mathnet.ru/eng/ppi/v44/i3/p105
|
Statistics & downloads: |
Abstract page: | 559 | Full-text PDF : | 116 | References: | 58 | First page: | 7 |
|