**A New Class of Hyper-bent Boolean Functions with Multiple Trace Terms**

*Chunming Tang, Yanfeng Qi, Maozhi Xu, Baocheng Wang, Yixian Yang*

**Abstract: **Introduced by Rothaus in 1976 as interesting combinatorial objects, bent functions are maximally nonlinear Boolean functions with even
numbers of variables whose Hamming distance to the set of all affine functions equals $2^{n-1}\pm 2^{\frac{n}{2}-1}$. Not only bent functions are applied in cryptography, such as applications in components of S-box, block cipher and stream cipher, but also they have relations to coding theory. Hence a lot of research have been
paid on them. Youssef and Gong introduced a new class of bent functions the so-called hyper-bent functions which have stronger properties and rarer elements. It seems that hyper-bent functions are more difficult to generate. Moreover, (hyper)-bent functions are not classified. Charpin and Gong studied a class of hyper-bent functions $f$ defined on $\mathbb{F}_{2^n}$ by $f=\sum\limits_{r\in R}\mathrm{Tr}_{1}^{n}(a_{r}x^{r(2^m-1)})$, $n=2m$ and $a_{r}\in \mathbb{F}_{2^n}$, where $R$ is a subset of a set of representatives of the cyclotomic cosets modulo $2^m + 1$ for which each coset has the full size $n$. Further, Mesnager contributed to the knowledge of a class of hyper-bent functions $f_{b}$ defined over $\mathbb{F}_{2^n}$ by $f_{b}=\sum\limits_{r\in R}\mathrm{Tr}_{1}^{n}(a_{r}x^{r(2^m-1)})+\mathrm{Tr}_{1}^{2}(bx^{\frac{2^n-1}{3}})$, $b\in \mathbb{F}_{4}$, $n=2m$ and $a_{r}\in \mathbb{F}_{2^m}$. In this paper, we
study a new class of the hyper-bent functions $f_{b}$ defined over $\mathbb{F}_{2^n}$ by $f_{b}=\sum\limits_{r\in R}\mathrm{Tr}_{1}^{n}(a_{r}x^{r(2^m-1)})+\mathrm{Tr}_{1}^{4}(bx^{\frac{2^n-1}{5}})$,
$b\in \mathbb{F}_{16}$, $n=2m$ and $a_{r}\in \mathbb{F}_{2^m}$.

**Category / Keywords: **Boolean functions, bent functions, hyper-bent functions, Walsh-Hadamard tranformation, Dickson polynomials.

**Date: **received 5 Nov 2011, last revised 6 May 2012

**Contact author: **tangchunmingmath at 163 com

**Available format(s): **PDF | BibTeX Citation

**Version: **20120506:071817 (All versions of this report)

**Short URL: **ia.cr/2011/600

**Discussion forum: **Show discussion | Start new discussion

[ Cryptology ePrint archive ]