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. Their inherent ...

Abstract: Various generalizations of binary Boolean bent functions have some applications in both binary and multiple-valued domain. The generalized Boolean functions having binary variables but ...

The Quine-McCluskey algorithm, also known as the tabulation method, is a method used for minimization of Boolean functions. It is an exact method and provides a systematic approach to simplify Boolean ...

ABSTRACT: Binary Decision Diagrams (BDDs) can be graphically manipulated to reduce the number of nodes and hence the area. In this context, ordering of BDDs play a major role. Most of the algorithms ...

Applicable Analysis and Discrete Mathematics, Vol. 10, No. 2 (October 2016), pp. 408-446 (39 pages) An associative Boolean tree is a plane rooted tree whose internal nodes are labelled by AND or OR ...

The concept originates from mathematician George Boole, who in the 19th century developed an algebraic system of logic using only two values: true and false. In computer science, this binary way of ...