Hyper-bent Functions
نویسندگان
چکیده
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.
منابع مشابه
The Bent and Hyper-Bent Properties of a Class of Boolean Functions
This paper considers the bent and hyper-bent properties of a class of Boolean functions. For one case, we present a detailed description for them to be hyper-bent functions, and give a necessary condition for them to be bent functions for another case. Keywords—Boolean functions, bent functions, hyper-bent
متن کاملConstructing Hyper-Bent Functions from Boolean Functions with the Walsh Spectrum Taking the Same Value Twice
Hyper-bent functions as a subclass of bent functions attract much interest and it is elusive to completely characterize hyper-bent functions. Most of known hyper-bent functions are Boolean functions with Dillon exponents and they are often characterized by special values of Kloosterman sums. In this paper, we present a method for characterizing hyper-bent functions with Dillon exponents. A clas...
متن کاملHyper-bent Boolean Functions with Multiple Trace Terms
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 2n−1 ± 2 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 ...
متن کاملA new class of hyper-bent functions and Kloosterman sums
This paper is devoted to the characterization of hyper-bent functions. Several classes of hyper-bent functions have been studied, such as Charpin and Gong’s ∑ r∈R Tr1 (arx r(2m−1)) and Mesnager’s ∑ r∈R Tr1 (arx r(2m−1)) + Tr1(bx 2n−1 3 ), where R is a set of representations of the cyclotomic cosets modulo 2 + 1 of full size n and ar ∈ F2m . In this paper, we generalize their results and conside...
متن کاملA generalization of the class of hyper-bent Boolean functions in binomial forms
Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals 2n−1 ± 2n2−1, were introduced by Rothaus in 1976 when he considered problems in combinatorics. Bent functions have been extensively studied due to their applications in cryptography, such as S-box, block cipher and stream cipher. Fur...
متن کامل