Combinatorial Constructions of Bent Functions
Abstract
It is very difficult not only to classify bent functions, but also to find methods for constructing them. Combinatorial methods for constructing bent functions such as iterative constructions, the Maiorana-McFarland construction, and the partial spread method are discussed in this chapter. Following work by Carlet, we divide constructions into two groups: direct and iterative (or recursive). The second group consists of methods that use already known bent functions (e.g., with fewer variables), whereas the first group contains only direct methods. We try to consider all known basic constructions of bent functions. We deal in general with combinatorial constructions, whereas in ...
Get Bent Functions now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
