Bent function

Bent functions are defined in terms of the Walsh transform. The Walsh transform of a Boolean function ${\displaystyle f:\mathbb {Z} _{2}^{n}\to \mathbb {Z} _{2}}$ is the function ${\displaystyle {\hat {f}}:\mathbb {Z} _{2}^{n}\to \mathbb {Z} }$ given by

${\displaystyle {\hat {f}}(a)=\sum _{\scriptstyle {x\in \mathbb {Z} _{2}^{n}}}(-1)^{f(x)+a\cdot x},}$

where a · x = a₁x₁ + a₂x₂ + … + a_nx_n (mod 2) is the dot product in Zⁿ
₂.[4] Alternatively, let S₀(a) = { x ∈ Zⁿ
₂ : f(x) = a · x } and S₁(a) = { x ∈ Zⁿ
₂ : f(x) ≠ a · x }. Then |S₀(a)| + |S₁(a)| = 2ⁿ and hence

${\displaystyle {\hat {f}}(a)=\left|S_{0}(a)\right|-\left|S_{1}(a)\right|=2\left|S_{0}(a)\right|-2^{n}.}$

For any Boolean function f and a ∈ Zⁿ
₂, the transform lies in the range

${\displaystyle -2^{n}\leq {\hat {f}}(a)\leq 2^{n}.}$

Moreover, the linear function f₀(x) = a · x and the affine function f₁(x) = a · x + 1 correspond to the two extreme cases, since

${\displaystyle {\hat {f}}_{0}(a)=2^{n},~{\hat {f}}_{1}(a)=-2^{n}.}$

Thus, for each a ∈ Zⁿ
₂ the value of ${\displaystyle {\hat {f}}(a)}$ characterizes where the function f(x) lies in the range from f₀(x) to f₁(x).

Rothaus defined a bent function as a Boolean function ${\displaystyle f:\mathbb {Z} _{2}^{n}\to \mathbb {Z} _{2}}$ whose Walsh transform has constant absolute value. Bent functions are in a sense equidistant from all the affine functions, so they are equally hard to approximate with any affine function.

The simplest examples of bent functions, written in algebraic normal form, are F(x₁, x₂) = x₁x₂ and G(x₁, x₂, x₃, x₄) = x₁x₂ ⊕ x₃x₄. This pattern continues: x₁x₂ ⊕ x₃x₄ ⊕ … ⊕ x_n−1x_n is a bent function ${\displaystyle \mathbb {Z} _{2}^{n}\to \mathbb {Z} _{2}}$ for every even n, but there is a wide variety of other bent functions as n increases.[5] The sequence of values (−1)^f(x), with x ∈ Zⁿ
₂ taken in lexicographical order, is called a bent sequence; bent functions and bent sequences have equivalent properties. In this ±1 form, the Walsh transform is easily computed as

${\displaystyle {\hat {f}}(a)=W\left(2^{n}\right)(-1)^{f(a)},}$

where W(2ⁿ) is the natural-ordered Walsh matrix and the sequence is treated as a column vector.[6]

Rothaus proved that bent functions exist only for even n, and that for a bent function f, ${\displaystyle \left|{\hat {f}}(a)\right|=2^{n/2}}$ for all a ∈ Zⁿ
₂.[4] In fact, ${\displaystyle {\hat {f}}(a)=2^{n/2}(-1)^{g(a)}}$, where g is also bent. In this case, ${\displaystyle {\hat {g}}(a)=2^{n/2}(-1)^{f(a)}}$, so f and g are considered dual functions.[6]

Every bent function has a Hamming weight (number of times it takes the value 1) of 2ⁿ⁻¹ ± 2^n/2−1, and in fact agrees with any affine function at one of those two numbers of points. So the nonlinearity of f (minimum number of times it equals any affine function) is 2ⁿ⁻¹ − 2^n/2−1, the maximum possible. Conversely, any Boolean function with nonlinearity 2ⁿ⁻¹ − 2^n/2−1 is bent.[4] The degree of f in algebraic normal form (called the nonlinear order of f) is at most n/2 (for n > 2).[5]

Although bent functions are vanishingly rare among Boolean functions of many variables, they come in many different kinds. There has been detailed research into special classes of bent functions, such as the homogeneous ones[7] or those arising from a monomial over a finite field,[8] but so far the bent functions have defied all attempts at a complete enumeration or classification.

There are several types of constructions for bent functions.[2]

• Combinatorial constructions: iterative constructions, Maiorana–McFarland construction, partial spreads, Dillon's and Dobbertin's bent functions, minterm bent functions, bent iterative functions
• Algebraic constructions: monomial bent functions with exponents of Gold, Dillon, Kasami, Canteaut–Leander and Canteaut–Charpin–Kuyreghyan; Niho bent functions, etc.

As early as 1982 it was discovered that maximum length sequences based on bent functions have cross-correlation and autocorrelation properties rivalling those of the Gold codes and Kasami codes for use in CDMA.[9] These sequences have several applications in spread spectrum techniques.

The properties of bent functions are naturally of interest in modern digital cryptography, which seeks to obscure relationships between input and output. By 1988 Forré recognized that the Walsh transform of a function can be used to show that it satisfies the strict avalanche criterion (SAC) and higher-order generalizations, and recommended this tool to select candidates for good S-boxes achieving near-perfect diffusion.[10] Indeed, the functions satisfying the SAC to the highest possible order are always bent.[11] Furthermore, the bent functions are as far as possible from having what are called linear structures, nonzero vectors a such that f(x + a) + f(x) is a constant. In the language of differential cryptanalysis (introduced after this property was discovered) the derivative of a bent function f at every nonzero point a (that is, f_a(x) = f(x + a) + f(x)) is a balanced Boolean function, taking on each value exactly half of the time. This property is called perfect nonlinearity.[5]

Given such good diffusion properties, apparently perfect resistance to differential cryptanalysis, and resistance by definition to linear cryptanalysis, bent functions might at first seem the ideal choice for secure cryptographic functions such as S-boxes. Their fatal flaw is that they fail to be balanced. In particular, an invertible S-box cannot be constructed directly from bent functions, and a stream cipher using a bent combining function is vulnerable to a correlation attack. Instead, one might start with a bent function and randomly complement appropriate values until the result is balanced. The modified function still has high nonlinearity, and as such functions are very rare the process should be much faster than a brute-force search.[5] But functions produced in this way may lose other desirable properties, even failing to satisfy the SAC – so careful testing is necessary.[11] A number of cryptographers have worked on techniques for generating balanced functions that preserve as many of the good cryptographic qualities of bent functions as possible.[12][13][14]

Some of this theoretical research has been incorporated into real cryptographic algorithms. The CAST design procedure, used by Carlisle Adams and Stafford Tavares to construct the S-boxes for the block ciphers CAST-128 and CAST-256, makes use of bent functions.[14] The cryptographic hash function HAVAL uses Boolean functions built from representatives of all four of the equivalence classes of bent functions on six variables.[15] The stream cipher Grain uses an NLFSR whose nonlinear feedback polynomial is, by design, the sum of a bent function and a linear function.[16]

More than 25 different generalizations of bent functions are described in Tokareva's 2015 monograph.[2] There are algebraic generalizations (q-valued bent functions, p-ary bent functions, bent functions over a finite field, generalized Boolean bent functions of Schmidt, bent functions from a finite Abelian group into the set of complex numbers on the unit circle, bent functions from a finite Abelian group into a finite Abelian group, non-Abelian bent functions, vectorial G-bent functions, multidimensional bent functions on a finite Abelian group), combinatorial generalizations (symmetric bent functions, homogeneous bent functions, rotation symmetric bent functions, normal bent functions, self-dual and anti-self-dual bent functions, partially defined bent functions, plateaued functions, Z-bent functions and quantum bent functions) and cryptographic generalizations (semi-bent functions, balanced bent functions, partially bent functions, hyper-bent functions, bent functions of higher order, k-bent functions).

The most common class of generalized bent functions is the mod m type, ${\displaystyle f:\mathbb {Z} _{m}^{n}\to \mathbb {Z} _{m}}$ such that

${\displaystyle {\hat {f}}(a)=\sum _{x\in \mathbb {Z} _{m}^{n}}e^{{\frac {2\pi i}{m}}(f(x)-a\cdot x)}}$

has constant absolute value m^n/2. Perfect nonlinear functions ${\displaystyle f:\mathbb {Z} _{m}^{n}\to \mathbb {Z} _{m}}$, those such that for all nonzero a, f(x + a) − f(a) takes on each value mⁿ⁻¹ times, are generalized bent. If m is prime, the converse is true. In most cases only prime m are considered. For odd prime m, there are generalized bent functions for every positive n, even and odd. They have many of the same good cryptographic properties as the binary bent functions.[17][18]

Semi-bent functions are an odd-order counterpart to bent functions. A semi-bent function is ${\displaystyle f:\mathbb {Z} _{m}^{n}\to \mathbb {Z} _{m}}$ with n odd, such that ${\displaystyle \left|{\hat {f}}\right|}$ takes only the values 0 and m^(n+1)/2. They also have good cryptographic characteristics, and some of them are balanced, taking on all possible values equally often.[19]

The partially bent functions form a large class defined by a condition on the Walsh transform and autocorrelation functions. All affine and bent functions are partially bent. This is in turn a proper subclass of the plateaued functions.[20]

The idea behind the hyper-bent functions is to maximize the minimum distance to all Boolean functions coming from bijective monomials on the finite field GF(2ⁿ), not just the affine functions. For these functions this distance is constant, which may make them resistant to an interpolation attack.

Other related names have been given to cryptographically important classes of functions ${\displaystyle f:\mathbb {Z} _{2}^{n}\to \mathbb {Z} _{2}^{n}}$, such as almost bent functions and crooked functions. While not bent functions themselves (these are not even Boolean functions), they are closely related to the bent functions and have good nonlinearity properties.

• Correlation immunity

• C. Carlet (May 1993). Two New Classes of Bent Functions. Eurocrypt '93. pp. 77–101.
• J. Seberry; X. Zhang (March 1994). "Constructions of Bent Functions from Two Known Bent Functions". Australasian Journal of Combinatorics. 9: 21–35. CiteSeerX 10.1.1.55.531. ISSN 1034-4942.
• T. Neumann (May 2006). "Bent Functions". CiteSeerX 10.1.1.85.8731. {{cite journal}}: Cite journal requires |journal= (help)
• Colbourn, Charles J.; Dinitz, Jeffrey H. (2006). Handbook of Combinatorial Designs (2nd ed.). CRC Press. pp. 337–339. ISBN 978-1-58488-506-1.
• Cusick, T.W.; Stanica, P. (2009). Cryptographic Boolean Functions and Applications. Academic Press. ISBN 9780123748904.