TOPICS
Search

Bent Function


A bent function is a Boolean function f:F_2^n->F_2 whose Walsh transform

 W_f(a)=sum_(x in F_2^n)(-1)^(f(x)+a·x)

has |W_f(a)|=2^(n/2) for every a in F_2^n, where a·x is the dot product over the finite field F_2 (Rothaus 1976). Bent functions exist only when n is even. For example, f(x)=x_1x_2+x_3x_4+...+x_(n-1)x_n, with arithmetic in F_2, is bent.

Every Boolean function has a unique representation as a multilinear polynomial over F_2. For even n>=4, the polynomial degree of a bent function is at most n/2 (Rothaus 1976). The converse question of representing every Boolean function of degree at most n/2 as a sum of two bent functions is Tokareva's conjecture.


See also

Boolean Function, Tokareva's Conjecture, Walsh Transform

Explore with Wolfram|Alpha

References

Rothaus, O. S. "On 'Bent' Functions." J. Combin. Th. Ser. A 20, 300-305, 1976. https://doi.org/10.1016/0097-3165(76)90024-8.Tokareva, N. N. "On Decomposition of a Boolean Function into Sum of Bent Functions." Siberian Electron. Math. Rep. 11, 745-751, 2014.

Cite this as:

Weisstein, Eric W. "Bent Function." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/BentFunction.html

Subject classifications