Boolean functions without prediction
Stanislav Vitalevich Smyshlyaev · Discrete Mathematics and Applications · 2011
We study properties of Boolean functions with a finite-length barrier and suggest a criterion for a function to possess a barrier. We introduce the notion of a Boolean function without prediction which describes certain positive cryptographic properties of the corresponding transformations of binary sequences. We suggest a criterion for a Boolean function to belong to the class of functions without prediction.