On Semibent Boolean Functions
Claude Carlet, Sihem Mesnager · IEEE Transactions on Information Theory · 2012
We show that any Boolean function, in even dimension, equal to the sum of a Boolean functiongwhich is constant on each element of a spread and of a Boolean functionhwhose restrictions to these elements are all linear, is semibent if and only ifgandhare both bent. We deduce a large number of infinite classes of semibent functions in explicit bivariate (respectively, univariate) polynomial form.