Related papers: A new class of hyper-bent Boolean functions in bin…
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…
Feistel Boomerang Connectivity Table (FBCT) is an important cryptanalytic technique on analysing the resistance of the Feistel network-based ciphers to power attacks such as differential and boomerang attacks. Moreover, the coefficients of…
The study of iterations of functions over a finite field and the corresponding functional graphs is a growing area of research with connections to cryptography. The behaviour of such iterations is frequently approximated by what is know as…
We show (almost) separation between certain important classes of Boolean functions. The technique that we use is to show that the total influence of functions in one class is less than the total influence of functions in the other class. In…
The subject of this textbook is the analysis of Boolean functions. Roughly speaking, this refers to studying Boolean functions $f : \{0,1\}^n \to \{0,1\}$ via their Fourier expansion and other analytic means. Boolean functions are perhaps…
The Gauss hypergeometric functions 2F1 with arbitrary values of parameters are reduced to two functions with fixed values of parameters, which differ from the original ones by integers. It is shown that in the case of integer and/or…
Mathematical functions, which often appear in mathematical analysis, are referred to as special functions and have been studied over hundreds of years. Many books and dictionaries are available that describe their properties and serve as a…
Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable functions. Each function in this class is polynomial time computable when we restrict to finite…
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…
Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks as the curse of dimensionality (CoD) cannot be evaded when trying to approximate even a single ReLU neuron…
In this paper, we present a construction of linear codes over $\f_{2^t}$ from Boolean functions, which is a generalization of Ding's method \cite[Theorem 9]{Ding15}. Based on this construction, we give two classes of linear codes…
In this paper, by the Hasse-Weil bound, we determine the necessary and sufficient condition on coefficients $a_1,a_2,a_3\in\mathbb{F}_{2^n}$ with $n=2m$ such that $f(x) = {x}^{3\cdot2^m} + a_1x^{2^{m+1}+1} + a_2 x^{2^m+2} + a_3x^3$ is an…
We discuss the classes $\fC$, $\fM$, and $\fS$ of analytic functions that can be realized as the Liv\v{s}ic characteristic functions of a symmetric densely defined operator $\dot A$ with deficiency indices $(1,1)$, the Weyl-Titchmarsh…
Plateaued functions as an extension of bent functions play a significant role in cryptography, coding theory, sequences and combinatorics. In \cite{Mesnager9}, Mesnager \emph{et al.} introduced generalized plateaued functions in order to…
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…
We introduce and study a new scale of function spaces that characterize the homogeneous Besov spaces $\mathrm{\dot B}^{\beta}_{p,q}$, hence completing earlier work by Ullrich. These new spaces include the ones introduced by Barton and…
Polynomial threshold gates are basic processing units of an artificial neural network. When the input vectors are binary vectors, these gates correspond to Boolean functions and can be analyzed via their polynomial representations. In…
We show that the there exists an infinite family of APN functions of the form $F(x)=x^{2^{s}+1} + x^{2^{k+s}+2^k} + cx^{2^{k+s}+1} + c^{2^k}x^{2^k + 2^s} + \delta x^{2^{k}+1}$, over $\gf_{2^{2k}}$, where $k$ is an even integer and…
In the BFA 2023 conference paper, A. Polujan, L. Mariot and S. Picek exhibited the first example of a non-normal but weakly normal bent function in dimension 8. In this note, we present numerical approaches based on the classification of…
This paper introduces a novel quantum algorithm that is able to classify a hierarchy of classes of imbalanced Boolean functions. The fundamental characteristic of imbalanced Boolean functions is that the proportion of elements in their…