Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean functions, which has led to increased interest in the study of these functions. The canalizing depth of a function describes how many canalizing variables can be recursively “picked off”, until a non-canalizing function remains. In this paper, w...

S-boxes are important building blocks in block ciphers. For secure design one should not choose an S-box that has low degree. In this work we consider minimum degree of an S-box which is the minimum value of the degree of the nonzero component functions of the S-box. For an S-box F : F2 → F2 , there are 2m−1 nonzero component functions, we show that there is a better way to determine the minimu...

We study the circuit complexity of boolean functions in a certain infinite basis. The basis consists of all functions that take value 1 on antichains over the boolean cube. We prove that the circuit complexity of the parity function and the majority function of n variables in this basis is b 2 c and ⌊ n 2 ⌋ +1 respectively. We show that the asymptotic of the maximum complexity of n-variable boo...

Vectorial Boolean bent functions, which possess the maximal nonlinearity and the minimum differential uniformity, contribute to optimum resistance against linear cryptanalysis and differential cryptanalysis. H vectorial functions is an infinite class of vectorial Boolean bent functions presented by S. Mesnager. This paper is devoted to further characterization of the H vectorial functions. It i...

Although several methods for estimating the resistance of a random Boolean function against (fast) algebraic attacks were proposed, these methods are usually infeasible in practice for relative large input variables n (for instance n ≥ 30) due to increased computational complexity. An efficient estimation the resistance of Boolean function (with relative large input variables n) against (fast) ...

Threshold, 2-monotonic and interval Boolean functions constitute special classes of Boolean functions for which it is easy to decide many problems which are intractable for general Boolean functions. In our article we show that positive interval functions are a proper subset of positive threshold functions. Then we prove one property of 2-monotonic functions which is related to testing whether ...

In this paper was explored well known model k-OBDD. There are proven width based hierarchy of classes of boolean functions which computed by k-OBDD. The proof of hierarchy is based on sufficient condition of Boolean function’s non representation as k-OBDD and complexity properties of Boolean function SAF. This function is modification of known Pointer Jumping (PJ) and Indirect Storage Access (I...

In this paper was explored well known model k-OBDD. There are proven width based hierarchy of classes of boolean functions which computed by k-OBDD. The proof of hierarchy is based on sufficient condition of Boolean function’s non representation as k-OBDD and complexity properties of Boolean function SAF. This function is modification of known Pointer Jumping (PJ) and Indirect Storage Access (I...