English
Related papers

Related papers: Non-existence results for vectorial bent functions…

200 papers

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

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

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

For each non-constant $q$ in the set of $n$-variable Boolean functions, the {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable from $q$ by nonsingular linear change of…

Cryptography and Security · Computer Science 2017-11-09 Zhixiong Chen , Ting Gu , Andrew Klapper

This paper is devoted to the study of non-existence of certain type of convex functions on a Riemannian manifold with a pole. To this end, we have developed the notion of odd and even function on a Riemannian manifold with a pole and proved…

Differential Geometry · Mathematics 2019-07-08 Absos Ali Shaikh , Chandan Kumar Mondal , Izhar Ahmad

In this paper, we study the Hamming distance between vectorial Boolean functions and affine functions. This parameter is known to be related to the non-linearity and differential uniformity of vectorial functions, while the calculation of…

Combinatorics · Mathematics 2025-03-07 Gabor P. Nagy

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 this paper we prove four cases of the vanishing conjecture of differential operators with constant coefficients and also a conjecture on the Laurent polynomials with no holomorphic parts, which were proposed in [Zh3] by the third named…

Commutative Algebra · Mathematics 2022-08-12 Arno van den Essen , Roel Willems , Wenhua Zhao

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

Nous \'etudions la non lin\'earit\'e des fonctions d\'efinies sur F_{2^m} o\`u $m$ est un entier impair, associ\'ees aux polyn\^omes de degr\'e 7 ou \`a des polyn\^omes plus g\'en\'eraux. ----- We study the nonlinearity of the functions…

Number Theory · Mathematics 2007-06-05 François Rodier , Eric Férard

Bent functions from a vector space $V_n$ over $\mathbb F_2$ of even dimension $n=2m$ into the cyclic group $\mathbb Z_{2^k}$, or equivalently, relative difference sets in $V_n\times\mathbb Z_{2^k}$ with forbidden subgroup $\mathbb Z_{2^k}$,…

Number Theory · Mathematics 2020-09-24 Wilfried Meidl , Isabel Pirsic

We systematically analyze a class of hexanomial functions over finite fields of characteristic $2$ proposed by Dillon (2006) as candidates for almost perfect nonlinear (APN) functions, significantly extending earlier partial-APN results.…

Number Theory · Mathematics 2026-02-24 Daniele Bartoli , Giovanni Giuseppe Grimaldi , Pantelimon Stanica

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

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

Bent functions can be classified into regular bent functions, weakly regular but not regular bent functions, and non-weakly regular bent functions. Regular and weakly regular bent functions always appear in pairs since their duals are also…

Information Theory · Computer Science 2015-11-10 Ayca Cesmelioglu , Wilfried Meidl , Alexander Pott

In this paper, we obtain a new class of $p$-ary binomial bent functions which are determined by Kloosterman sums. The bentness of another three classes of functions is characterized by some exponential sums and some results in…

Information Theory · Computer Science 2014-04-14 L. Yu , H. Liu , D. Zheng

Two classes of ternary bent functions of degree four with two and three terms in the univariate representation that belong to the completed Maiorana-McFarland class are found. Binomials are mappings $\F_{3^{4k}}\mapsto\fthree$ given by…

Discrete Mathematics · Computer Science 2025-07-29 Tor Helleseth , Alexander Kholosha , Niki Spithaki

We discuss the existence of zero coefficients in the powers of the determinant polynomial of order $n$. D. G. Glynn proved that the coefficients of the $m$th power of the determinant polynomial are all nonzero, if $m = p-1$ with a prime…

Combinatorics · Mathematics 2021-04-05 Minoru Itoh , Jimpei Shimoyoshi

A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…

Combinatorics · Mathematics 2024-10-29 V. N. Potapov , A. A. Taranenko , Yu. V. Tarannikov

There are two construction methods of designs from $(n,m)$-bent functions, known as translation and addition designs. In this paper we analyze, which equivalence relation for Boolean bent functions, i.e. $(n,1)$-bent functions, and…

Information Theory · Computer Science 2021-05-04 Alexandr Polujan , Alexander Pott