Abstract
Bent functions have maximal minimum distance to the set of affine functions. In other words, they achieve the maximal minimum distance to all the coordinate functions of affine monomials. In this paper we introduce a new class of bent functions which we call hyper-bent functions. Functions within this class achieve the maximal minimum distance to all the coordinate functions of all bijective monomials. We provide an explicit construction for such functions. We also extend our results to vectorial hyper-bent functions.
Author supplied keywords
Cite
CITATION STYLE
Youssef, A. M., & Gong, G. (2001). Hyper-bent functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2045, pp. 406–419). Springer Verlag. https://doi.org/10.1007/3-540-44987-6_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
