### An analysis of the $C$ class of bent functions

Bimal Mandal, Pantelimon Stanica, Sugata Gangopadhyay, and Enes Pasalic

##### Abstract

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 $D_0$). In this article, we look in more detail 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 $\mathbb F_{2^n}$. 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.

Available format(s)
Category
Secret-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
Boolean functionbent function.
Contact author(s)
gsugata @ gmail com
History
Short URL
https://ia.cr/2015/588

CC BY

BibTeX

@misc{cryptoeprint:2015/588,
author = {Bimal Mandal and Pantelimon Stanica and Sugata Gangopadhyay and Enes Pasalic},
title = {An analysis of the $C$ class of bent functions},
howpublished = {Cryptology ePrint Archive, Paper 2015/588},
year = {2015},
note = {\url{https://eprint.iacr.org/2015/588}},
url = {https://eprint.iacr.org/2015/588}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.