S-boxes (vector output Boolean functions) should satisfy cryptographic criteria even if some input bits (say, k bits) are kept constant. However, this kind of security has been studied only for scalar output Boolean functions. SAC(k) is a criterion for scalar output Boolean functions of this type. This paper studies a generalization of SAC(k) to vector output Boolean functions as the rst step t...

Recently, one of the hot topics on vectorial Boolean bent functions is to construct vectorial Boolean bent functions in the form Tr m(P (x)) from Boolean bent functions in the form Tr 1 (P (x)), where P (x) ∈ F2n [x]. This paper first presents three constructions of vectorial Boolean bent functions in the form Tr m(P (x)), where two of them give answers to two open problems proposed by Pasalic ...

In digital systems where Boolean functions are frequently manipulated, it is important to know how evaluation time of Boolean functions is consumed during their execution by the processor. Estimation of the evaluation time of Boolean functions plays an important role in function-architecture co-design. The evaluation time complexity of Boolean functions represented by Binary Decision Diagrams (...

It is well-known that all Boolean functions of n variables can be computed by a logic circuit with o(2n/n) gates (Lupanov's theorem) and that there exist Boolean functions of n variables which require logic circuits of this size (Shannon's theorem). We present corresponding results for Boolean functions computed by VLSI circuits, using Thompson's model of a VLSI chip. We prove that all Boolean ...