Bent functions are Boolean functions on an even number of variables that are as far as possible from every affine function. In combinatorics, they show up in cryptography and design theory because their extreme non-linearity creates strong, structured patterns.
Bent functions are Boolean functions in combinatorics that are maximally non-linear. That means, if you compare one to every affine function, it stays as far away as possible from all of them. This makes bent functions stand out in the study of Boolean mappings because they resist simple linear description.
A Boolean function outputs 0 or 1 from input variables that are also usually 0 or 1. Many Boolean functions are easy to approximate by linear or affine functions, which is useful in counting and algebraic analysis but bad for security applications. Bent functions are the opposite: they are built so that no affine function gives a close fit.
There is a catch, though. Bent functions only exist when the number of variables is even. That restriction is part of what makes them mathematically interesting in combinatorics. Their Walsh or Hadamard spectrum has flat magnitude, which is another way of saying the function is evenly spread out in the frequency-style analysis used for Boolean functions.
A good way to picture the idea is this: if affine functions are the simplest possible Boolean patterns, bent functions are intentionally the hardest to approximate by those patterns. For example, on four variables, a bent function will be as non-linear as the theory allows, so it is not just complicated by accident. Its structure is carefully balanced.
That balance is why bent functions connect to combinatorial designs, codes, and cryptographic constructions. In a combinatorics class, you usually meet them when a topic turns from counting objects to designing objects with specific properties. The function itself is only one piece of the story, but it is a very controlled piece.
Bent functions matter in combinatorics because they connect algebraic structure to design choices. Once you start asking how to build a Boolean function that avoids linear patterns, you move into the same kind of thinking used in coding theory, block designs, and secure system design.
They are a clean example of an extremal object: not just any Boolean function, but one that achieves the largest possible distance from affine functions. That makes them useful when a problem asks for the best possible resistance to linear approximation or for a construction with strong symmetry and balance.
In cryptography, that resistance helps defend against linear attacks, so bent functions often appear in the background of substitution boxes, stream cipher design, and related constructions. In combinatorial design theory, their spectrum and algebraic form can be used to build optimal codes or sequences with desirable correlation properties.
They also give you a concrete place to use tools like the Hadamard transform. Instead of treating transforms as abstract machinery, bent functions show why spectrum-based analysis matters: the transform reveals how far the function is from simpler Boolean behavior. That makes them a useful bridge between counting, algebra, and construction problems.
Keep studying COMBINATORICS Unit 16
Visual cheatsheet
view galleryBoolean function
Bent functions are a special kind of Boolean function, so the first step is knowing the basic setup, inputs of 0 or 1 and outputs of 0 or 1. Once you understand Boolean functions, bent functions become the extreme case where the output pattern is arranged to avoid any easy affine description. That is what makes them stand out in combinatorics.
Non-linearity
Non-linearity is the property bent functions maximize. If a Boolean function is highly non-linear, it is harder to approximate with affine functions, which is exactly the goal in many cryptographic constructions. Bent functions are the benchmark example, so they often appear when a problem asks for the most non-linear possible Boolean behavior.
Hadamard transform
The Hadamard transform is one way to measure how a Boolean function behaves across different linear combinations of its inputs. Bent functions have a very flat transform spectrum, which is another way to see their extremal structure. If you are analyzing a function’s non-linearity, the Hadamard transform is one of the main tools that makes the result visible.
t-design
Bent functions can be linked to combinatorial designs because both involve structured balance. A t-design arranges subsets so they satisfy exact counting rules, while a bent function arranges truth values so they avoid linear bias. The connection is not that they are the same thing, but that both use symmetry and regularity to force a very specific outcome.
A problem set question might give you a Boolean function and ask whether it could be bent, or ask you to explain why bent functions only exist for an even number of variables. You may also be asked to connect bent functions to non-linearity, affine functions, or the Hadamard transform.
When you answer, state the defining feature first: maximum distance from every affine function. Then use the course language that fits the task, such as "non-linear," "balanced spectrum," or "extremal Boolean function." If the question is about applications, mention cryptographic resistance to linear attacks or the link to combinatorial designs and codes.
For a computation-style prompt, the move is usually to compare the given function against affine candidates or to interpret its transform values, not to memorize a long list of examples. If the question is conceptual, be ready to explain why this is a construction problem, not just a definition question.
A Boolean function is the broad category, any function that maps binary inputs to binary outputs. A bent function is a very specific Boolean function with maximum non-linearity. So every bent function is Boolean, but most Boolean functions are not bent.
Bent functions are Boolean functions with the greatest possible distance from all affine functions.
They only exist for an even number of variables, which makes them a special extremal case in combinatorics.
Their strong non-linearity is why they show up in cryptography, especially when a construction needs resistance to linear attacks.
The Hadamard transform is one of the main tools used to describe and analyze bent functions.
Bent functions also connect to combinatorial designs and coding theory because they give highly structured, balanced constructions.
Bent functions are Boolean functions on an even number of variables that are maximally non-linear. In combinatorics, they matter because they give a clean example of an extremal construction, one that is as far as possible from every affine function. That makes them useful in design theory, coding theory, and cryptography.
That restriction comes from the structure of their transform and the way maximum non-linearity is achieved. If the number of variables is odd, the balance needed for a bent function cannot happen in the same way. In practice, this is one of the quickest facts to remember about them.
An ordinary Boolean function may be simple, linear-looking, or easy to approximate with an affine function. A bent function is the opposite, it is intentionally as hard as possible to approximate linearly. So bent functions are not a separate kind of output format, they are a special extremal class inside Boolean functions.
You usually see them in questions about non-linearity, affine approximation, the Hadamard transform, or cryptographic design. A typical prompt might ask you to explain why a function is bent, why it cannot exist in the odd-variable case, or how it supports secure system design. The main skill is connecting the definition to the structure behind it.