On Various Nonlinearity Measures for Boolean Functions.

A necessary condition for the security of cryptographic functions is to be "sufficiently distant" from linear, and cryptographers have proposed several measures for this distance. In this paper, we show that six common measures, , and , are incomparable in the sense that for each pair of measures, μ, μ, there exist functions , with being more nonlinear than according to μ, but less nonlinear according to μ. We also present new connections between two of these measures. Additionally, we give a lower bound on the multiplicative complexity of collision-free functions.