Abstract:
The problem of combining different cryptographic properties of vectorial Boolean functions is considered. An upper nonlinearity bound for vectorial Boolean functions constructed using affine Boolean functions is obtained. It is shown that, for any natural $n$, the bound is reachable. Besides, a lower bound for the number of vectorial functions having a fixed nonlinearity and constructed from balanced Boolean functions is obtained.