English
Related papers

Related papers: On functions with the maximal number of bent compo…

200 papers

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

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

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 consider exceptional APN functions on ${\bf F}_{2^m}$, which by definition are functions that are not APN on infinitely many extensions of ${\bf F}_{2^m}$. Our main result is that polynomial functions of odd degree are not exceptional,…

Algebraic Geometry · Mathematics 2009-11-13 Yves Aubry , Gary Mcguire , François Rodier

Let $n=2m$. In the present paper, we study the binomial Boolean functions of the form $$f_{a,b}(x) = \mathrm{Tr}_1^{n}(a x^{2^m-1 }) +\mathrm{Tr}_1^{2}(bx^{\frac{2^n-1}{3} }), $$ where $m$ is an even positive integer, $a\in…

Information Theory · Computer Science 2021-09-29 Chunming Tang , Peng Han , Qi Wang , Jun Zhang , Yanfeng Qi

We consider negabent Boolean functions that have Trace representation. We completely characterize quadratic negabent monomial functions. We show the relation between negabent functions and bent functions via a quadratic function. Using this…

Information Theory · Computer Science 2014-06-05 Sumanta Sarkar

In 2008, Langevin and Leander determined the dual function of three classes of monomial bent functions with the help of Stickelberger's theorem: Dillon, Gold and Kasami. In their paper, they proposed one very strong condition such that…

Information Theory · Computer Science 2021-07-06 Honggang Hu , Bei Wang , Xianhong Xie , Yiyuan Luo

We prove that functions $f:\f{2^m} \to \f{2^m}$ of the form $f(x)=x^{-1}+g(x)$ where $g$ is any non-affine polynomial are APN on at most a finite number of fields $\f{2^m}$. Furthermore we prove that when the degree of $g$ is less then 7…

Algebraic Geometry · Mathematics 2009-01-28 Gregor Leander , François Rodier

Inspired by a recent work of Mesnager, we present several new infinite families of quadratic ternary bent, near-bent and 2-plateaued functions from some known quadratic ternary bent functions. Meanwhile, the distribution of the Walsh…

Information Theory · Computer Science 2015-08-17 Guangkui Xu , Xiwang Cao

Partially APN functions attract researchers' particular interest recently. It plays an important role in studying APN functions. In this paper, based on the multivariate method and resultant elimination, we propose several new infinite…

Information Theory · Computer Science 2022-10-06 Yan-Ping Wang , Zhengbang Zha

We prove new non-existence results for vectorial monomial Dillon type bent functions mapping the field of order $2^{2m}$ to the field of order $2^{m/3}$. When $m$ is odd and $m>3$ we show that there are no such functions. When $m$ is even…

Information Theory · Computer Science 2021-11-01 Lucien Lapierre , Petr Lisonek

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é

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

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

In the literature, few constructions of $n$-variable rotation symmetric bent functions have been presented, which either have restriction on $n$ or have algebraic degree no more than $4$. In this paper, for any even integer $n=2m\ge2$, a…

Information Theory · Computer Science 2015-05-13 Sihong Su , Xiaohu Tang

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

In this paper, a technique on constructing nonlinear resilient Boolean functions is described. By using several sets of disjoint spectra functions on a small number of variables, an almost optimal resilient function on a large even number…

Information Theory · Computer Science 2009-11-18 WeiGuo Zhang , GuoZhen Xiao

In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…

Discrete Mathematics · Computer Science 2020-07-07 Erhan Oztop , Minoru Asada

Almost perfect nonlinear (APN) functions play an important role in the design of block ciphers as they offer the strongest resistance against differential cryptanalysis. Despite more than 25 years of research, only a limited number of APN…

Combinatorics · Mathematics 2020-12-01 Christian Kaspers , Yue Zhou

Zhou 2013 introduced modified planar functions to describe $(2^n,2^n,2^n,1)$ relative difference sets $R$ as a graph of a function on the finite field $\F_{2^n}$, and pointed out that projections of $R$ are difference sets that can be…

Number Theory · Mathematics 2016-11-15 Nurdagül Anbar , Wilfried Meidl