Abstract:
The paper defines a class of Boolean functions constructed from higher bit sequences of several linear recurrences over the ring $\mathbb{Z}_{2^n}.$ To build the higher bit sequences various coordinate sets are used. It is shown that this class consists of functions that are significantly far from the class of all linear functions.
Key words:linear recurrent sequences, Boolean functions, bit sequences.