Cryptographic properties of monotone Boolean functions
MetadataShow full item record
We prove various results on monotone Boolean functions. In particular, we prove a conjecture proposed recently, stating that there are no monotone bent Boolean functions. Further, we give an upper bound on the nonlinearity of monotone functions in odd dimension, we describe the Walsh–Hadamard spectrum and investigate some other cryptographic properties of monotone Boolean functions.
The article of record as published may be found at http://dx.doi.org/10.1515/jmc-2014-0030
Showing items related by title, author, creator and subject.
Sasao, Tsutomu; Butler, Jon T. (1996);In VLSI, crossings of interconnect occupy space and cause delay. Therefore, there is significant benefit to planar circuits. We propose the use of planar multiple-valued decision diagrams for produce planar multiple-valued ...
Nagayama, Shinobu; Sasao, Tsutomu; Butler, Jon T. (Old City Publishing, Inc., 2013);A multi-state system with multi-state components is a model of systems, where performance, capacity, or reliability levels of the systems are represented as states. It usually has more than two states, and thus can be ...
Nagayama, Shinobu; Sasao, Tsutomu; Butler, Jon T. (2009);This paper proposes a design method for floating-point numerical function generators (NFGs) using multi-valued decision diagrams (MDDs). Our method applies to monotone elementary functions in which real values are converted ...