An analysis of the C class of bent functions

Download
Author
Stănică, Pantelimon
Mandal, Bimal
Gangopadhyay, Sugata
Pasalic, Enes
Date
2015-06-14Metadata
Show full item recordAbstract
Two (so-called C;D) classes of permutation-based bent Boolean functions were introduced by Carlet two decades ago, but without specifying some explicit construction methods
for their construction (apart from the subclass D0). In this article, we look in more de-
tail at the C class, and derive some existence and nonexistence results concerning the bent
functions in the C class for many of the known classes of permutations over F2n. Most
importantly, the existence results induce generic methods of constructing bent functions
in class C which possibly do not belong to the completed Maiorana-McFarland class. The
question whether the specific permutations and related subspaces we identify in this article
indeed give bent functions outside the completed Maiorana-McFarland class remains open.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.Collections
Related items
Showing items related by title, author, creator and subject.
-
Characteristics of the binary decision diagrams of Boolean Bent Functions
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 ... -
Minimization of SOPs for bi-decomposable functions and non-orthodox/orthodox functions
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 ...