On Weak and Strong 2k-Bent Boolean Functions
نویسنده
چکیده
In this paper we introduce a sequence of discrete Fourier transforms and define new versions of bent functions, which we shall call (weak, strong) octa/hexa/2-bent functions. We investigate relationships between these classes and completely characterize the octabent and hexabent functions in terms of bent functions.
منابع مشابه
On the Primary Constructions of Vectorial Boolean Bent Functions∗
Vectorial Boolean bent functions, which possess the maximal nonlinearity and the minimum differential uniformity, contribute to optimum resistance against linear cryptanalysis and differential cryptanalysis for the cryptographic algorithms that adopt them as nonlinear components. This paper is devoted to the new primary constructions of vectorial Boolean bent functions, including four types: ve...
متن کاملOn weak and strong 2-bent Boolean functions
In this paper we introduce a sequence of discrete Fourier transforms and define new versions of bent functions, which we shall call (weak, strong) octa/hexadeca and in general, 2-bent functions. We investigate relationships between these classes and completely characterize the octabent and hexadecabent functions in terms of bent functions. We further find relative difference sets based upon the...
متن کاملComplete Characterization of Generalized Bent and 2k-Bent Boolean Functions
In this paper we investigate properties of generalized bent Boolean functions and 2-bent (i.e., negabent, octabent, hexadecabent, et al.) Boolean functions in a uniform framework. We generalize the work of Stǎnicǎ et al., present necessary and sufficient conditions for generalized bent Boolean functions and 2-bent Boolean functions in terms of classical bent functions, and completely characteri...
متن کاملConstruction of bent functions via Niho power functions
A Boolean function with an even number n = 2k of variables is called bent if it is maximally nonlinear. We present here a new construction of bent functions. Boolean functions of the form f(x) = tr(α1x1 + α2x2), α1, α2, x ∈ F2n , are considered, where the exponents di (i = 1, 2) are of Niho type, i.e. the restriction of xi on F2k is linear. We prove for d1 = 2 + 1 and d2 = 3 · 2k−1 − 1, d2 = 2 ...
متن کاملHighly Nonlinear 0 - 1 Balanced Boolean Functions Satisfying
Nonlinearity, 0-1 balancedness and strict avalanche criterion (SAC) are important criteria for cryptographic functions. Bent functions have maximum nonlinearity and satisfy SAC however they are not 0-1 balanced and hence cannot be directly used in many cryptosystems where 0-1 balancedness is needed. In this paper we construct (i) 0-1 balanced boolean functions on V2k+1 (k > = 1) having nonlinea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 62 شماره
صفحات -
تاریخ انتشار 2015