English
Related papers

Related papers: On constructions and properties of self-dual gener…

200 papers

Every Boolean bent function $f$ can be written either as a concatenation $f=f_1||f_2$ of two complementary semi-bent functions $f_1,f_2$; or as a concatenation $f=f_1||f_2||f_3||f_4$ of four Boolean functions $f_1,f_2,f_3,f_4$, all of which…

Information Theory · Computer Science 2024-04-26 Sadmir Kudin , Enes Pasalic , Alexandr Polujan , Fengrong Zhang

In this paper we characterize (octal) bent generalized Boolean functions defined on $\BBZ_2^n$ with values in $\BBZ_8$. Moreover, we propose several constructions of such generalized bent functions for both $n$ even and $n$ odd.

Combinatorics · Mathematics 2011-03-07 Pante Stanica , Thor Martinsen

Bent functions are Boolean functions in an even number of variables that are indicators of Hadamard difference sets in elementary abelian 2-groups. A bent function in m variables is said to be normal if it is constant on an affine space of…

Discrete Mathematics · Computer Science 2025-05-01 Valérie Gillot , Philippe Langevin , Alexandr Polujan

Let $G$ be a finite abelian group acting faithfully on a finite set $X$. As a natural generalization of the perfect nonlinearity of Boolean functions, the $G$-bentness and $G$-perfect nonlinearity of functions on $X$ are studied by Poinsot…

Discrete Mathematics · Computer Science 2014-06-18 Yun Fan , Bangteng Xu

In this article, we provide the first systematic analysis of bent functions $f$ on $\mathbb{F}_2^{n}$ in the Maiorana-McFarland class $\mathcal{MM}$ regarding the origin and cardinality of their $\mathcal{M}$-subspaces, i.e., vector…

Information Theory · Computer Science 2023-04-27 Enes Pasalic , Alexandr Polujan , Sadmir Kudin , Fengrong Zhang

Difference balanced functions from $F_{q^n}^*$ to $F_q$ are closely related to combinatorial designs and naturally define $p$-ary sequences with the ideal two-level autocorrelation. In the literature, all existing such functions are…

Combinatorics · Mathematics 2013-10-01 Alexander Pott , Qi Wang

In this paper, we consider the characterization of the bentness of quadratic Boolean functions of the form $f(x)=\sum_{i=1}^{\frac{m}{2}-1} Tr^n_1(c_ix^{1+2^{ei}})+ Tr_1^{n/2}(c_{m/2}x^{1+2^{n/2}}) ,$ where $n=me$, $m$ is even and $c_i\in…

Information Theory · Computer Science 2013-08-14 Chunming Tang , Yanfeng Qi

Based on the definition of generalized partially bent functions, using the theory of linear transformation, the relationship among generalized partially bent functions over ring Z N, generalized bent functions over ring Z N and affine…

Cryptography and Security · Computer Science 2007-05-23 Jianqin Zhou

Bent functions, or equivalently, Hadamard difference sets in the elementary Abelian group $(\gf(2^{2m}), +)$, have been employed to construct symmetric and quasi-symmetric designs having the symmetric difference property. The main objective…

Combinatorics · Mathematics 2019-04-26 Cunsheng Ding , Akihiro Munemasa , Vladimir Tonchev

We show that the graph of a bent function is a Salem set in an appropriate sense. We also establish a simple result that quantifies redundancies in the difference operators of a function, which applies to bent functions over fields of odd…

Combinatorics · Mathematics 2025-11-25 Robert S. Coulter , Steven Senger

We obtain new nonexistence results for two classes of generalized bent functions from $\mathbb{Z}_{q}^{n}$ to $\mathbb{Z}_{q}$, called type $[n,q]$ generalized bent functions. The first class concerns the case $q=2 p_1^{e_1} p_2^{e_2}$,…

Combinatorics · Mathematics 2026-05-26 Shi Ying , Yingpu Deng

In this letter, we give a characterization for a generic construction of bent functions. This characterization enables us to obtain another efficient construction of bent functions and to give a positive answer on a problem of bent…

Information Theory · Computer Science 2024-03-12 Yanjun Li , Jinjie Gao , Haibin Kan , Jie Peng , Lijing Zheng , Changhui Chen

In this paper we prove that in opposite to the cases of 6 and 8 variables, the Maiorana-McFarland construction does not describe the whole class of cubic bent functions in $n$ variables for all $n\ge 10$. Moreover, we show that for almost…

Combinatorics · Mathematics 2020-04-03 Alexandr Polujan , Alexander Pott

Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals $2^{n-1}\pm 2^{\frac{n}{2}-1}$, were introduced by Rothaus in 1976 when he…

Information Theory · Computer Science 2012-05-08 Chunming Tang , Yanfeng Qi , Maozhi Xu , Baocheng Wang , Yixian Yang

An important classification of permutations over $\mathbb{F}_2^m$, suitable for constructing Maiorana-McFarland bent functions on $\mathbb{F}_2^m \times \mathbb{F}_2^m$ with the unique $M$-subspace of maximal dimension, was recently…

Combinatorics · Mathematics 2025-08-21 Sadmir Kudin , Enes Pasalic , Alexandr Polujan , Fengrong Zhang

We define two finite q-analogs of certain multiple harmonic series with an arbitrary number of free parameters, and prove identities for these q-analogs, expressing them in terms of multiply nested sums involving the Gaussian binomial…

Combinatorics · Mathematics 2007-06-13 David M. Bradley

For any bent function, it is very interesting to determine its dual function because the dual function is also bent in certain cases. For $k$ odd and $\gcd(n, k)=1$, it is known that the Coulter-Matthews bent function…

Information Theory · Computer Science 2016-05-04 Honggang Hu , Qingsheng Zhang , Shuai Shao

In this paper we define a class of Boolean and generalized Boolean functions defined on $\mathbb{F}_2^n$ with values in $\mathbb{Z}_q$ (mostly, we consider $q=2^k$), which we call landscape functions (whose class containing generalized…

Information Theory · Computer Science 2018-06-18 Constanza Riera , Pantelimon Stanica

Let $m$ be an even positive integer. A Boolean bent function $f$ on $\GF{m-1} \times \GF {}$ is called a \emph{cyclic bent function} if for any $a\neq b\in \GF {m-1}$ and $\epsilon \in \GF{}$, $f(ax_1,x_2)+f(bx_1,x_2+\epsilon)$ is always…

Information Theory · Computer Science 2018-11-20 Cunsheng Ding , Sihem Mesnager , Chunming Tang , Maosheng Xiong

For any positive integers $n=2k$ and $m$ such that $m\geq k$, in this paper we show the maximal number of bent components of any $(n,m)$-functions is equal to $2^{m}-2^{m-k}$, and for those attaining the equality, their algebraic degree is…

Information Theory · Computer Science 2019-05-28 Lijing Zheng , Jie Peng , Haibin Kan , Yanjun Li , Juan Luo