|
This article is cited in 5 scientific papers (total 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.
Received: 03.09.2010
Citation:
S. V. Smyshlyaev, “Boolean functions without prediction”, Diskr. Mat., 23:1 (2011), 102–118; Discrete Math. Appl., 21:2 (2011), 209–227
Linking options:
https://www.mathnet.ru/eng/dm1134https://doi.org/10.4213/dm1134 https://www.mathnet.ru/eng/dm/v23/i1/p102
|
|