On a recursive class of plateaued Boolean functions
Diskretnaya Matematika, Tome 22 (2010) no. 4, pp. 20-33
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
We investigate properties of a class of plateaued Boolean functions with support of the spectrum defined by a recursive class of matrices. For such supports of the spectrum, we find a precise number of functions with a given support. We also show that the set of these functions is the equivalence class of a function with this support of spectrum with respect to the group of shifts.
[1] Tarannikov Yu. V., “O znacheniyakh affinnogo ranga nositelya spektra platovidnoi funktsii”, Diskretnaya matematika, 18:3 (2006), 120–137 | MR | Zbl
[2] Logachev O. A., Salnikov A. A., Yaschenko V. V., Bulevy funktsii v teorii kodirovaniya i kriptografii, MTsNMO, Moskva, 2004
[3] Tarannikov Yu. V., “O korrelyatsionno-immunnykh i ustoichivykh bulevykh funktsiyakh”, Matematicheskie voprosy kibernetiki, 11, 2002, 91–148 | MR | Zbl