English
Related papers

Related papers: Design and analysis of bent functions using $\math…

200 papers

The report studies the generation of ternary bent functions by permuting the circular Vilenkin_Chrestenson spectrum of a known bent function. We call this spectral invariant operations in the spectral domain, in analogy to the spectral…

Discrete Mathematics · Computer Science 2019-12-19 Claudio Moraga , Milena Stankovic , Radomir S. Stankovic

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

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

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

We study vectorial functions with maximal number of bent components in this paper. We first study the Walsh transform and nonlinearity of $F(x)=x^{2^e}h(\Tr_{2^{2m}/2^m}(x))$, where $e\geq0$ and $h(x)$ is a permutation over $\F_{2^m}$. If…

Information Theory · Computer Science 2023-06-01 Xianhong Xie , Yi Ouyang

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

Vectorial dual-bent functions have recently attracted some researchers' interest as they play a significant role in constructing partial difference sets, association schemes, bent partitions and linear codes. In this paper, we further study…

Information Theory · Computer Science 2023-09-26 Jiaxin Wang , Fang-Wei Fu , Yadi Wei , Jing Yang

Much work has been devoted to bent functions in odd characteristic, but there still remains a gap between our knowledge of binary and nonbinary bent functions. In the first part of this paper, we attempt to partially bridge this gap by…

Discrete Mathematics · Computer Science 2026-04-20 Claude Carlet , and Alexander Kholosha

Bent functions as optimal combinatorial objects are difficult to characterize and construct. In the literature, bent idempotents are a special class of bent functions and few constructions have been presented, which are restricted by the…

Information Theory · Computer Science 2015-08-25 Chunming Tang , Yanfeng Qi , Zhengchun Zhou , Cuiling Fan

Negabent functions as a class of generalized bent functions have attracted a lot of attention recently due to their applications in cryptography and coding theory. In this paper, we consider the constructions of negabent functions over…

Information Theory · Computer Science 2016-06-30 Gaofei Wu , Nian Li , Yuqing Zhang , Xuefeng Liu

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

We give a new simple construction for known binary quadratic symmetric bent and almost bent functions. In particular, for even number of variables, they are self-dual and anti-self-dual quadratic bent functions, respectively, which are not…

Information Theory · Computer Science 2019-09-24 Josep Rifà , Victor Zinoviev

It has been an active research issue for many years to construct new bent functions. For $k$ odd with $\gcd(n, k)=1$, and $a\in\mathbb{F}_{3^n}^{*}$, the function $f(x)=Tr(ax^{\frac{3^k+1}{2}})$ is weakly regular bent over…

Information Theory · Computer Science 2017-07-18 Honggang Hu , Xiaolong Yang , Shaohua Tang

Let $n$ be an even positive integer, and $m<n$ be one of its positive divisors. In this paper, inspired by a nice work of Tang et al. on constructing large classes of bent functions from known bent functions [27, IEEE TIT, 63(10):…

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

A function $F:\mathbb{F}_2^n\rightarrow \mathbb{F}_2^n$, $n=2m$, can have at most $2^n-2^m$ bent component functions. Trivial examples are obtained as $F(x) = (f_1(x),\ldots,f_m(x),a_1(x),\ldots, a_m(x))$, where…

Number Theory · Mathematics 2020-10-09 Nurdagül Anbar , Tekgül Kalaycı , Wilfried Meidl , László Mérai

In this paper we introduce generalized hyperbent functions from $F_{2^n}$ to $Z_{2^k}$, and investigate decompositions of generalized (hyper)bent functions. We show that generalized (hyper)bent functions from $F_{2^n}$ to $Z_{2^k}$ consist…

Information Theory · Computer Science 2016-04-12 Thor Martinsen , Wilfried Meidl , Sihem Mesnager , 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

We provide constructions of bent functions using triples of permutations. This approach is due to Mesnager. In general, involutions have been mostly considered in such a machinery; we provide some other suitable triples of permutations,…

Combinatorics · Mathematics 2019-07-10 Daniele Bartoli , Maria Montanucci , Giovanni Zini

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

In this paper we introduce and study two new subclasses \Sigma_{\lambda\mu mp}(\alpha,\beta)$ and $\Sigma^{+}_{\lambda\mu mp}(\alpha,\beta)$ of meromorphically multivalent functions which are defined by means of a new differential operator.…

Complex Variables · Mathematics 2011-03-10 Halit Orhan , Dorina Raducanu , Erhan Deniz