On quadratic approximations in block ciphers Full article
| Journal |
Problems of Information Transmission
ISSN: 0032-9460 , E-ISSN: 1608-3253 |
||
|---|---|---|---|
| Output data | Year: 2008, Volume: 44, Number: 3, Pages: 266-286 Pages count : 21 DOI: 10.1134/s0032946008030083 | ||
| Authors |
|
||
| Affiliations |
|
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 4-bit permutations recommended for use in S-boxes of the algorithms GOST 28147-89, DES, and s3DES; 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.
Cite:
Tokareva N.N.
On quadratic approximations in block ciphers
Problems of Information Transmission. 2008. V.44. N3. P.266-286. DOI: 10.1134/s0032946008030083 WOS Scopus OpenAlex
On quadratic approximations in block ciphers
Problems of Information Transmission. 2008. V.44. N3. P.266-286. DOI: 10.1134/s0032946008030083 WOS Scopus OpenAlex
Identifiers:
| Web of science: | WOS:000260150400008 |
| Scopus: | 2-s2.0-54349116797 |
| OpenAlex: | W1990139055 |