English
Related papers

Related papers: Construction methods for generalized bent function…

200 papers

Bent functions are balanced by restricting their domains to vectors with either even or odd Hamming weights, which ensures an equal number of pre-images for both, 0 and 1. Using the previous fact, we can construct bent functions on two…

General Mathematics · Mathematics 2025-08-27 Juan Carlos Ku-Cauich , Javier Arturo Díaz-Vargas , Sara Mandujano-Velazquez

We obtain new nonexistence results of generalized bent functions from $\{Z^n}_q$ to $\Z_q$ (called type $[n,q]$) in the case that there exist cyclotomic integers in $ \Z[\zeta_{q}]$ with absolute value $q^{\frac{n}{2}}$. This result…

Information Theory · Computer Science 2015-07-27 Jianing Li , Yingpu Deng

We present a new result on the nonexistence of generalized bent functions (GBFs)from (Z/tZ)^n to Z/tZ (called type [n, t]) for a large class. Assume p is an odd prime number. By showing certain quadratic norm form equations having no…

Information Theory · Computer Science 2026-03-26 Chang Lv , Yuqing Zhu

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

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

In 2017, Zhang et al. proposed a question (not open problem) and two open problems in [IEEE TIT 63 (8): 5336--5349, 2017] about constructing bent functions by using Rothaus' construction. In this note, we prove that the sufficient…

Information Theory · Computer Science 2025-02-17 Fei Guo , Zilong Wang , Guang Gong

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

Bent-negabent functions have many important properties for their application in cryptography since they have the flat absolute spectrum under the both Walsh-Hadamard transform and nega-Hadamard transform. In this paper, we present four new…

Information Theory · Computer Science 2022-09-20 Fei Guo , Zilong Wang , Guang Gong

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

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

In a recent paper \cite{Zhang-Xiao}, Zhang and Xiao describe a technique on constructing almost optimal resilient functions on even number of variables. In this paper, we will present an extensive study of the constructions of almost…

Cryptography and Security · Computer Science 2010-03-19 WeiGuo Zhang , GuoZhen Xiao

A one to one correspondence between regular generalized bent functions from $\F_2^n$ to $\Z_{2^m},$ and $m-$tuples of Boolean bent functions is established. This correspondence maps self-dual (resp. anti-self-dual) generalized bent…

Information Theory · Computer Science 2016-11-22 Lin Sok , MinJia Shi , Patrick Solé

In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard matrices, and abelian splitting relative difference sets. We establish a broader network of equivalences by considering…

Combinatorics · Mathematics 2022-07-13 José Andrés Armario , Ronan Egan , Dane Flannery

In this paper we generalize the partial spread class and completely describe it for generalized Boolean functions from $\F_2^n$ to $\mathbb{Z}_{2^t}$. Explicitly, we describe gbent functions from $\F_2^n$ to $\mathbb{Z}_{2^t}$, which can be…

Information Theory · Computer Science 2015-11-06 Thor Martinsen , Wilfried Meidl , Pantelimon Stanica

Generalized bent (gbent) functions from an $n$-variable Boolean space to $\mathbb{Z}_{2^k}$ are central in cryptography and sequence design. Instead of the usual binary decomposition, we introduce a $2^\ell$-adic representation, for $k=\ell…

Number Theory · Mathematics 2026-04-03 Ayça Çeşmelioğlu , Constanza Riera , Pantelimon Stănică

Let $\mathbb{F}_{p^{n}}$ be the finite field with $p^n$ elements and $\operatorname{Tr}(\cdot)$ be the trace function from $\mathbb{F}_{p^{n}}$ to $\mathbb{F}_{p}$, where $p$ is a prime and $n$ is an integer. Inspired by the works of…

Information Theory · Computer Science 2021-08-03 Xi Xie , Nian Li , Xiangyong Zeng , Xiaohu Tang , Yao Yao

In this paper, we discuss when a class function on a finite group is a bent function. We have found a necessary condition for a class function on a finite abelian group to be bent. Also, we have found a necessary and sufficient condition…

Combinatorics · Mathematics 2018-08-01 Mani Shankar Pandey , Sumit Kumar Upadhyay , Vipul Kakkar

In this paper, we present some new nonexistence results on $(m,n)$-generalized bent functions, which improved recent results. More precisely, we derive new nonexistence results for general $n$ and $m$ odd or $m \equiv 2 \pmod{4}$, and…

Combinatorics · Mathematics 2019-08-05 Ka Hin Leung , Qi Wang

In this work, we employ the concept of {\em composite representation} of Boolean functions, which represents an arbitrary Boolean function as a composition of one Boolean function and one vectorial function, for the purpose of specifying…

Information Theory · Computer Science 2018-09-21 S. Hodžić , E. Pasalic , Y. Wei

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