The Fourier Entrophy-Influence Conjecture Holds for a Log-Density 1 Class of Cryptographic Boolean Functions
MetadataShow full item record
We consider the Fourier Entropy-Infuence (FEI) conjecture in the context of cryptographic Boolean functions. We show that the FEI conjecture is true for the functions satisfying the strict avalanche criterion, which forms a subset of asymptotic log-density 1 in the set of all Boolean functions. Further, we prove that the FEI conjecture is satisfied for plateaued Boolean functions, monomial algebraic normal form (with the best involved constant), direct sums, as well as concatenations of Boolean functions. As a simple con- sequence of these general results we fi nd that each affine equivalence class of quadratic Boolean functions contains at least one function satisfying the FEI conjecture. Further, we propose some leveled" FEI conjectures.
This paper was written during an enjoyable visit of S. G. at the Applied Mathematics Department of Naval Postgraduate School in December, 2013.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
The Fourier Entropy-Influence Conjecture Holds for a Log-Density 1 Class of Cryptographic Boolean Functions Stănică, Pantelimon; Gangopadhyay, Sugata (2014-01-25);We consider the Fourier Entropy-Infl uence (FEI) conjecture in the context of cryptographic Boolean functions. We show that the FEI con jecture is true for the functions satisfying the strict avalanche criterion, which forms ...
Cusick, Thomas W.; Li, Yuan; Stănică, Pantelimon (2011);Recently, Tu and Deng proposed a combinatorial conjecture about binary strings, and, on the assumption that the conjecture is correct, they obtained two classes of Boolean functions which are both algebraic immunity optimal, ...
Carlet, Claude; Joyner, David; Stănică, Pantelimon; Tang, Deng (2016);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 ...