English
Related papers

Related papers: A Note on "Constructing Bent Functions Outside the…

200 papers

Bent functions of the form $\mathbb{F}_2^n\rightarrow\mathbb{Z}_q$, where $q\geqslant2$ is a positive integer, are known as generalized bent (gbent) functions. Gbent functions for which it is possible to define a dual gbent function are…

Combinatorics · Mathematics 2021-07-29 Aleksandr Kutsenko

We present a construction of partial spread bent functions using subspaces generated by linear recurring sequences (LRS). We first show that the kernels of the linear mappings defined by two LRS have a trivial intersection if and only if…

Cryptography and Security · Computer Science 2021-12-17 Maximilien Gadouleau , Luca Mariot , Stjepan Picek

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

The characterization and construction of bent functions are challenging problems. The paper generalizes the constructions of Boolean bent functions by Mesnager \cite{M2014}, Xu et al. \cite{XCX2015} and $p$-ary bent functions by Xu et al.…

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

In this article, we study bent functions on $\mathbb{F}_2^{2m}$ of the form $f(x,y) = x \cdot \phi(y) + h(y)$, where $x \in \mathbb{F}_2^{m-1} $ and $ y \in \mathbb{F}_2^{m+1}$, which form the generalized Maiorana-McFarland class (denoted…

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

We study generalized regular bent functions using a representation by bent rectangles, that is, special matrices with restrictions on rows and columns. We describe affine transformations of bent rectangles, propose new biaffine and bilinear…

Combinatorics · Mathematics 2008-04-18 Sergey Agievich

This note contains a simple construction of complete sets of MUBs, using bent functions to write the new basis vectors as explicit linear combinations of the standard basis.

Combinatorics · Mathematics 2026-05-19 William M. Kantor

In this article a procedure to construct bent functions from $\F_{p^n}$ to $\F_p$ by merging plateaued functions which are bent on ($n-2$)-dimensional subspaces of $\F_{p^n}$ is presented. Taking advantage of such classes of plateaued…

Number Theory · Mathematics 2013-10-31 Ayça Çeşmelioğlu , Wilfried Meidl

The purpose of this paper is to give explicit constructions of vectorial hyper-bent functions in the $\cP\cS_{ap}^{\#}$ class. It seems that the explicit constructions were so far known only for very special cases. To this end, we present a…

Combinatorics · Mathematics 2023-03-03 Jingkun Zhou , Chunming Tang , Fengrong Zhang

In this paper new classes of $L_2$-orthogonal functions are constructed as iterated $L_2$-orthogonal systems. In order to do this we use the theory of the Riemann's zeta-function as well as our theory of Jacob's ladders. The main result is…

Classical Analysis and ODEs · Mathematics 2021-04-27 Jan Moser

Several expansions of the solutions to the confluent Heun equation in terms of incomplete Beta functions are constructed. A new type of expansion involving certain combinations of the incomplete Beta functions as expansion functions is…

Mathematical Physics · Physics 2009-09-10 Artur Ishkhanyan

Bent Boolean functions are important objects in cryptography and coding theory, and there are several general approaches for constructing such functions. Metaheuristics proved to be a strong choice as they can provide many bent functions,…

Neural and Evolutionary Computing · Computer Science 2023-11-21 Claude Carlet , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

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 $\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

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

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

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

In this paper we study those bent functions which are linear on elements of spreads, their connections with ovals and line ovals, and we give descriptions of their dual bent functions. In particular, we give a geometric characterization of…

Combinatorics · Mathematics 2026-01-27 Kanat Abdukhalikov

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 the first part of this paper [16], some results on how to compute the flat spectra of Boolean constructions w.r.t. the transforms {I,H}^n, {H,N}^n and {I,H,N}^n were presented, and the relevance of Local Complementation to the quadratic…

Information Theory · Computer Science 2007-07-13 Constanza Riera , George Petrides , Matthew G. Parker