Nonlinearity measures of random Boolean functions

From MaRDI portal
Publication:301648

DOI10.1007/S12095-015-0164-3zbMATH Open1386.94121arXiv1308.3112OpenAlexW2136871609MaRDI QIDQ301648FDOQ301648


Authors: Kai-Uwe Schmidt Edit this on Wikidata


Publication date: 1 July 2016

Published in: Cryptography and Communications (Search for Journal in Brave)

Abstract: The r-th order nonlinearity of a Boolean function is the minimum number of elements that have to be changed in its truth table to arrive at a Boolean function of degree at most r. It is shown that the (suitably normalised) r-th order nonlinearity of a random Boolean function converges strongly for all rge 1. This extends results by Rodier for r=1 and by Dib for r=2. The methods in the present paper are mostly of elementary combinatorial nature and also lead to simpler proofs in the cases that r=1 or 2.


Full work available at URL: https://arxiv.org/abs/1308.3112




Recommendations




Cites Work


Cited In (12)





This page was built for publication: Nonlinearity measures of random Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301648)