This article is cited in 5 papers

Boolean functions without prediction

S. V. Smyshlyaev


Abstract: 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.

UDC: 512.7

Received: 03.09.2010

DOI: 10.4213/dm1134

 English version: Discrete Mathematics and Applications, 2011, 21:2, 209–227

Bibliographic databases:

• 
• 
•