A New Class of Bent Functions
Wenping Ma · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2005
In this letter, using techniques from linear algebra and coding theory, we characterize the quadratic Boolean functions represented by trace. We show that a linear combination of trace-terms over finite field can be determined to be bent by a polynomial GCD computation. Then we derive some new families of bent functions.