A key fact in the theory of Boolean functions f: {0, 1}n → {0, 1} is that they often undergo sharp thresholds. For example, if the function f: {0, 1}n → {0, 1} is monotone and symmetric under a ...

Beronika Daxner, Antoine Genitrini, Bernhard Gittenberger, Cécile Mailler, THE RELATION BETWEEN TREE SIZE COMPLEXITY AND PROBABILITY FOR BOOLEAN FUNCTIONS GENERATED BY UNIFORM RANDOM TREES, Applicable ...

Boolean functions form the backbone of modern cryptographic systems, serving as essential components in the design of stream ciphers, block ciphers, and other security protocols.

Abstract: “We introduce a Physically Unclonable Function (PUF) based on an ultra-fast chaotic network known as a Hybrid Boolean Network (HBN) implemented on a field programmable gate array. The ...