English
Related papers

Related papers: Construction methods for generalized bent function…

200 papers

A generalised Weber function is given by $\w_N(z) = \eta(z/N)/\eta(z)$, where $\eta(z)$ is the Dedekind function and $N$ is any integer; the original function corresponds to $N=2$. We classify the cases where some power $\w_N^e$ evaluated…

Number Theory · Mathematics 2013-12-23 Andreas Enge , François Morain

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

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 this paper we prove that in opposite to the cases of 6 and 8 variables, the Maiorana-McFarland construction does not describe the whole class of cubic bent functions in $n$ variables for all $n\ge 10$. Moreover, we show that for almost…

Combinatorics · Mathematics 2020-04-03 Alexandr Polujan , Alexander Pott

Several nonexistence results on generalized bent functions $f:Z_{2}^{n} \rightarrow Z_{m}$ presented by using some knowledge on cyclotomic number fields and their imaginary quadratic subfields.

Information Theory · Computer Science 2015-07-22 Haiying Liu , Keqin Feng , Rongquan Feng

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

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

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

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

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

In this paper, we first present a new secondary construction of bent functions (building new bent functions from two already defined ones). Furthermore, we apply the construction using as initial functions some specific bent functions and…

Cryptography and Security · Computer Science 2012-11-20 Fengrong Zhang , Claude Carlet , Yupu Hu , Wenzheng Zhang

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

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

An important classification of permutations over $\mathbb{F}_2^m$, suitable for constructing Maiorana-McFarland bent functions on $\mathbb{F}_2^m \times \mathbb{F}_2^m$ with the unique $M$-subspace of maximal dimension, was recently…

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

Whereas the design and properties of bent and plateaued functions have been frequently addressed during the past few decades, there are only a few design methods of so-called 5-valued spectra Boolean functions whose Walsh spectra takes the…

Information Theory · Computer Science 2018-11-29 S. Hodžić , E. Pasalic , W. G. Zhang

Generalisations of the bent property of a boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic boolean functions are related to simple graphs and it is shown…

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

In this paper, we investigate generalized bent functions (GBFs) from $\mathbb{Z}_3^n$ to $\mathbb{Z}_m$. We show that GBFs exist whenever $3$ divides $m$, while several nonexistence results are obtained when $3\nmid m$. In particular, we…

Combinatorics · Mathematics 2026-05-15 Priya Dhankhar , Sanjay Kumar Singh

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

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

We present necessary and sufficient conditions for a Boolean function to be a negabent function for both even and odd number of variables, which demonstrate the relationship between negabent functions and bent functions. By using these…

Information Theory · Computer Science 2012-05-31 Wei Su , Alexander Pott , Xiaohu Tang