Boolean functions are essential to systems for secure and reliable communication. This
comprehensive survey of Boolean functions for cryptography and coding covers the whole …

A fundamental objective of cryptography is to enable two persons to communicate over an
insecure channel (a public channel such as the internet) in such a way that any other person …

So far there is no systematic attempt to construct Boolean functions with maximum
annihilator immunity. In this paper we present a construction kee** in mind the basic …

In this paper, we analyze the algebraic immunity of symmetric Boolean functions. The
algebraic immunity is a property which measures the resistance against the algebraic …

In this paper we propose several efficient algorithms for assessing the resistance of Boolean
functions against algebraic and fast algebraic attacks when implemented in LFSR-based …

Symmetric switching functions (SSFs) play a prominent role in the reliability analysis of a
binary k-out-of-n: G system, which is a dichotomous system that is successful if and only if at …

Abstract The Deutsch-Jozsa algorithm is essentially faster than any possible deterministic
classical algorithm for solving a promise problem that is in fact a symmetric partial Boolean …

In this article we realize a general study on the nonlinearity of weightwise perfectly balanced
(WPB) functions. First, we derive upper and lower bounds on the nonlinearity from this class …

In this paper, we make a comprehensive study of two classes of Boolean functions whose
interest originally comes from hybrid symmetric-FHE encryption (with stream ciphers like …

In this article we perform a general study on the criterion of weightwise nonlinearity for the
functions which are weightwise perfectly balanced (WPB). First, we investigate the minimal …