On Weak and Strong 2k-Bent Boolean Functions
MetadataShow full item record
In this paper, we introduce a sequence of discrete Fourier transforms and define new versions of bent functions, which we shall call (weak and strong) octa/hexadeca and, in general, 2k-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 these functions.
The article of record as published may be found at http://dx.doi.org/10.1109/TIT.2016.2539971
Showing items related by title, author, creator and subject.
Schafer, Neil Brendan. (Monterey, California: Naval Postgraduate School, 2009-09);Boolean bent functions have desirable cryptographic properties in that they have maximum nonlinearity, which hardens a cryptographic function against linear cryptanalysis attacks. Furthermore, bent functions are extremely ...
Ulker, Birol (Monterey, Calif. Naval Postgraduate School, 2002-03);A logical function f is AND bi-decomposable if it can be written as f x1, x2)= h1 (x1) h2(x2), where x1 and x2 are disjoint. Such functions are important because they can be efficiently implemented. Also many benchmark ...
An analysis of bent function properties using the transeunt triangle and the SRC-6 reconfigurable computer Shafer, Jennifer L. (Monterey, California: Naval Postgraduate School, 2009-09);Linear attacks against cryptosystems can be defeated when combiner functions are composed of highly nonlinear Boolean functions. The highest nonlinearity Boolean functions, or bent functions, are not common- especially ...