An analysis of the C class of bent functions
MetadataShow full item record
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.
Showing items related by title, author, creator and subject.
Sasao, T.; Butler, Jon T. (2012-05);We demonstrate a circuit that generates a permutation in response to an index. Since there are n! n-element permutations, the index ranges from 0 to n! Ã Â¢ 1. Such a circuit is needed in the hardware implementation of ...
Chung, Jong Ho (Monterey, California: Naval Postgraduate School, 2013-09);In this thesis, we study a type of affine equivalence for the monomial rotation-symmetric (MRS) Boolean func-tions and two new construction techniques for cryptographic Boolean functions based on the affine equivalence of ...
Canright, David; Chung, Jong H.; Stănică, Pantelimon (Elsevier, 2015);The goal of this paper is two-fold. We first focus on the problem of deciding whether two monomial rotation symmetric (MRS) Boolean functions are affine equivalent via a permutation. Using a correspondence between such ...