Show simple item record

dc.contributor.authorStănică, Pantelimon
dc.contributor.authorGangopadhyay, Sugata
dc.dateJanuary 25, 2014
dc.date.accessioned2016-06-13T17:46:13Z
dc.date.available2016-06-13T17:46:13Z
dc.date.issued2014-01-25
dc.identifier.urihttp://hdl.handle.net/10945/48931
dc.description.abstractWe 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 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 find 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.en_US
dc.description.sponsorshipVSP award no. N62909-13-1-V105 (Department of the US Navy, ONR-Global)en_US
dc.format.extent12 p.en_US
dc.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.en_US
dc.titleThe Fourier Entropy-Influence Conjecture Holds for a Log-Density 1 Class of Cryptographic Boolean Functionsen_US
dc.contributor.corporateNaval Postgraduate School (U.S.)en_US
dc.contributor.departmentApplied Mathematicsen_US
dc.description.funderVSP award no. N62909-13-1-V105 (Department of the US Navy, ONR-Global)en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record