\input zb-basic
\input zb-ioport
\iteman{io-port 05648891}
\itemau{Simonetti, Ilaria}
\itemti{On the non-linearity of Boolean functions.}
\itemso{Sala, Massimiliano (ed.) et al., Gr\"obner bases, coding, and cryptography. Berlin: Springer (ISBN 978-3-540-93805-7/hbk; 978-3-540-93806-4/ebook). 409-413 (2009).}
\itemab
Introduction: Any function from $(\Bbb F_2)^n$ to $\Bbb F_2$ is called a Boolean function (Bf). Boolean functions are important in symmetric cryptography since they are used in the confusion layer of ciphers. An affine Bf does not provide an effective confusion. To overcome this, we need functions which are as far as possible from being an affine function. The effectiveness of these functions is measured by a parameter called ``nonlinearity''. Usually, to compute the nonlinearity of a Bf $f$, we have to compute the discrete Fourier transform $\widehat{f}_\chi$ of the function $f_\chi(x)= (-1)^{f(x)}$. Then the nonlinearity of $f$ is $N(f)= 2^{n-1}- \frac12 \max_{a\in(\Bbb F_2)^n} |\widehat{f}_\chi(a)|$.  In this paper, we compute the nonlinearity of Bf's with Gr\"obner bases.
\itemrv{~}
\itemcc{}
\itemut{Boolean function; confusion; affine function; nonlinearity; discrete Fourier transform; Gr\"obner bases}
\itemli{doi:10.1007/978-3-540-93806-4\_30}
\end