Paper 2016/335 Original: eprint.iacr.org/2016/335 ↗
Complete characterization of generalized bent and 2^k-bent Boolean functions
Abstract
In this paper we investigate properties of generalized bent Boolean functions and 2k-bent (i.e., negabent, octabent, hex- adecabent, et al.) Boolean functions in a uniform framework. We generalize the work of Stˇ anicˇ a et al., present necessary and sufficient conditions for generalized bent Boolean functions and 2k-bent Boolean functions in terms of classical bent functions, and completely characterize these functions in a combinatorial form. The result of this paper further shows that all generalized bent Boolean functions are regular.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2016-03-30: last updated
- 2016-03-30: published
- Short URL
- https://ia.cr/2016/335
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2016/335,
author = {Chunming Tang and Can Xiang and Yanfeng Qi and Keqin Feng},
title = {Complete characterization of generalized bent and 2^k-bent Boolean functions},
howpublished = {Cryptology {ePrint} Archive, Paper 2016/335},
year = {2016},
url = {https://eprint.iacr.org/2016/335}
}