Perfectly balanced functions were introduced by Sumarokov in . A well known class of such functions are those linear either in the first or in the last variable. We present a novel technique to construct perfectly balanced functions not in the above class.
In the present paper we study properties of perfectly balanced Boolean functions. Based on the concept of Boolean function barrier, we propose a novel approach to construct large classes of perfectly balanced Boolean functions.
We propose a novel efficient cryptanalytic technique allowing an adversary to recover an initial state of filter generator given its output sequence. The technique is applicable to filter generators possessing local affinity property.
The aim of this paper is to study a novel property of Boolean mappings called local intert-ibility. We focus on local invertibility of Boolean mappings which model ltering generators and study the case when ltering function is linear in the last variable.