Finite fields
Construction of bent functions from near-bent functions
Journal of Combinatorial Theory Series A
Strongly regular graphs associated with ternary bent functions
Journal of Combinatorial Theory Series A
Strongly regular graphs constructed from p-ary bent functions
Journal of Algebraic Combinatorics: An International Journal
A construction of weakly and non-weakly regular bent functions
Journal of Combinatorial Theory Series A
Normal extensions of bent functions
IEEE Transactions on Information Theory
On bent and semi-bent quadratic Boolean functions
IEEE Transactions on Information Theory
Monomial and quadratic bent functions over the finite fields of odd characteristic
IEEE Transactions on Information Theory
p-Ary and q-ary versions of certain results about bent functions and resilient functions
Finite Fields and Their Applications
Bent Functions of Maximal Degree
IEEE Transactions on Information Theory
Hi-index | 0.00 |
In this presentation, a technique for constructing bent functions from plateaued functions is introduced and analyzed. This generalizes earlier techniques for constructing bent from near-bent functions. Using this construction, we obtain a big variety of inequivalent bent functions, some weakly regular and some non-weakly regular. Classes of bent functions having some additional properties that enable the construction of strongly regular graphs are formed, and explicit expressions for bent functions with maximal degree are presented.