S-blocks with maximum component algebraic immunity on a small number of variables
Let n be a permutation on n elements, f be a Boolean function in n variables. Define a vector Boolean function Fn : Fn Fn as Fn(x) = (f (x), f (n(x)), • • • , f (nn-1(x)))). In this paper, we study the component algebraic immunity of the vector Boolean function Fn as a function of the Boolean function f and the permutation n for n = 3, 4,5. We obtain complete sets of Boolean and, partly, vector Boolean functions with maximum algebraic immunity in 3, 4 and 5 variables. If the function Fn has maximum algebraic immunity, then the permutation n is full cycle.
Keywords
component algebraic immunity, algebraic immunity, Boolean function, vector Boolean functionAuthors
Name | Organization | |
Zyubina D.A. | Novosibirsk State University; JetBrains Research Crypto Lab | zyubinadarya@gmail.com |
Tokareva N.N. | Institute of Mathematics. S. L. Sobolev SB RAS; Novosibirsk State University; Cryptography Lab JetBrains Research | tokareva@math.nsc.ru |
References

S-blocks with maximum component algebraic immunity on a small number of variables | Applied Discrete Mathematics. Supplement. 2021. № 14. DOI: 10.17223/2226308X/14/5