2016•IACR Cryptology ePrint ArchiveRequires access

Complete characterization of generalized bent and 2^k-bent Boolean functions.

Chunming Tang, Can Xiang, Yanfeng Qi, Keqin Feng

Open publisher page 1 citations

Abstract

In this paper, we investigate properties of generalized bent Boolean functions and $2^{k}$ -bent (i.e., negabent, octabent, hexadecabent, et al. ) Boolean functions in a uniform framework. From the Hadamard matrices, Hodžic and Pasalic presented sufficient conditions for generalized bent functions. Using cyclotomic fields and the decomposition of generalized bent functions, we generalize their results, prove that Hodžic and Pasalic’s conditions of generalized bent functions are not only sufficient but also necessary, and completely characterize generalized bent functions in terms of their component functions. Furthermore, we present a secondary construction of bent functions or semi-bent functions from generalized bent functions. Finally, we give the relations of generalized bent functions and $2^{k}$ -bent functions, demonstrate that $2^{k}$ -bent functions are actually a special class of generalized bent functions, and completely characterize $2^{k}$ -bent functions.

About this research paper

What this paper is about

In this paper, we investigate properties of generalized bent Boolean functions and $2^{k}$ -bent (i.e., negabent, octabent, hexadecabent, et al. ) Boolean functions in a uniform framework. From the Hadamard matrices, Hodžic and Pasalic presented sufficient conditions for generalized bent functions. Using cyclotomic fields and the decomposition of generalized bent functions, we generalize their results, prove that Hodžic and Pasalic’s conditions of generalized bent functions are not only sufficient but also necessary, and completely characterize generalized bent functions in terms of their component functions. Furthermore, we present a secondary construction of bent functions or semi-bent functions from generalized bent functions. Finally, we give the relations of generalized bent functions and $2^{k}$ -bent functions, demonstrate that $2^{k}$ -bent functions are actually a special class of generalized bent functions, and completely characterize $2^{k}$ -bent functions.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, we investigate properties of generalized bent Boolean functions and $2^{k}$ -bent (i.e., negabent, octabent, hexadecabent, et al. ) Boolean functions in a uniform framework. From the Hadamard matrices, Hodžic and Pasalic presented sufficient conditions for generalized bent functions. Using cyclotomic fields and the decomposition of generalized bent functions, we generalize their results, prove that Hodžic and Pasalic’s conditions of generalized bent functions are not only sufficient but also necessary, and completely characterize generalized bent functions in terms of their component functions. Furthermore, we present a secondary construction of bent functions or semi-bent functions from generalized bent functions. Finally, we give the relations of generalized bent functions and $2^{k}$ -bent functions, demonstrate that $2^{k}$ -bent functions are actually a special class of generalized bent functions, and completely characterize $2^{k}$ -bent functions.

Key concepts: Bent molecular geometry, Bent function, Boolean function, Mathematics, Characterization (materials science), Hadamard transform, Function (biology), Combinatorics

Related papers

Back to paper searchBrowse research topicsOriginal source
Complete characterization of generalized bent and 2^k-bent Boolean functions. — Research Paper | ScholarLens