相关论文: Generalised Bent Criteria for Boolean Functions (I…
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…
We derive a spectral interpretation of the pivot operation on a graph and generalise this operation to hypergraphs. We establish lower bounds on the number of flat spectra of a Boolean function, depending on internal structures, with…
In this paper we characterize (octal) bent generalized Boolean functions defined on $\BBZ_2^n$ with values in $\BBZ_8$. Moreover, we propose several constructions of such generalized bent functions for both $n$ even and $n$ odd.
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…
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…
Negabent Boolean functions are defined by having a flat magnitude spectrum under the nega-Hadamard transform. They exist in both even and odd dimensions, and the subclass of functions that are simultaneously bent and negabent…
In this work, we employ the concept of {\em composite representation} of Boolean functions, which represents an arbitrary Boolean function as a composition of one Boolean function and one vectorial function, for the purpose of specifying…
The necessary and sufficient conditions for a class of functions $f:\mathbb{Z}_2^n \rightarrow \mathbb{Z}_q$, where $q \geq 2$ is an even positive integer, have been recently identified for $q=4$ and $q=8$. In this article we give an…
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…
Bent functions are Boolean functions that are maximally nonlinear. They can be represented as bent squares, i.e., square matrices for which each row and each column is the Walsh spectrum of a Boolean function. Using this representation, it…
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…
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…
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):…
Generalized bent (gbent) functions is a class of functions $f: \mathbb{Z}_2^n \rightarrow \mathbb{Z}_q$, where $q \geq 2$ is a positive integer, that generalizes a concept of classical bent functions through their co-domain extension. A lot…
In this letter, we give a characterization for a generic construction of bent functions. This characterization enables us to obtain another efficient construction of bent functions and to give a positive answer on a problem of bent…
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…
In this work, the dual flatness, which is connected with Statistics and Information geometry, of general $(\alpha,\beta)$-metrics (a new class of Finsler metrics) is studied. A nice characterization for such metrics to be dually flat under…
It is shown that the counting function of n Boolean variables can be implemented with the formulae of size O(n^3.06) over the basis of all 2-input Boolean functions and of size O(n^4.54) over the standard basis. The same bounds follow for…
We discuss a generalisation of the Herbert formula for double points, when the normal bundle of an immersion admits an additional structure, and an application.
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…