Evolutionary Design of Trace Form Bent Functions

In order to design bent functions, evolutionary algorithm based on truth table, algebraic normal form or Walsh spectra are already known. Evolutionary algorithm based on trace function form is not known to authors' knowledge. In this paper, we give an evolutionary algorithm based on the trace representation of boolean function. With the algorithm, we constructed many bent functions and made some analysis work. First we observe that all 4 a#nely inequivalent bent classes in 6-variable can be written as the linear sum of 2 or 3 monomial trace functions