Related papers: Generic constructions of 5-valued spectra Boolean …
We give the first non-trivial upper bounds on the average sensitivity and noise sensitivity of polynomial threshold functions. More specifically, for a Boolean function f on n variables equal to the sign of a real, multivariate polynomial…
We propose a general approach to construct cryptographic significant Boolean functions of $(r+1)m$ variables based on the additive decomposition $\mathbb{F}_{2^{rm}}\times\mathbb{F}_{2^m}$ of the finite field $\mathbb{F}_{2^{(r+1)m}}$,…
The authors lay the foundations for the study of normal families of holomorphic functions and mappings on an infinite-dimensional normed linear space. Characterizations of normal families, in terms of value distribution, spherical…
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…
We are interested in Beurling spectrum of $\mathbb X-$valued functions with application in functional delay differential equations.
We theoretically study the resonance fluorescence spectra of the lambda ($\Lambda$), vee ($V$) and cascade ($\Xi$) type three-level configurations. It is shown that each system with two detuning frequencies can be modelled using the $SU(3)$…
We consider matrix products of the form $A_1(A_2A_2)^\top\ldots(A_{m}A_{m}^\top)A_{m+1}$, where $A_i$ are normalized random Fourier-Walsh matrices. We identify an interesting polynomial scaling regime when the operator norm of the expected…
In this paper we compute the Fourier spectra of some recently discovered binomial APN functions. One consequence of this is the determination of the nonlinearity of the functions, which measures their resistance to linear cryptanalysis.…
In this paper we prove results regarding Boolean functions with small spectral norm (the spectral norm of f is $\|\hat{f}\|_1=\sum_{\alpha}|\hat{f}(\alpha)|$). Specifically, we prove the following results for functions $f:\{0,1\}^n \to…
We address the problem of finding optimal strategies for computing Boolean symmetric functions. We consider a collocated network, where each node's transmissions can be heard by every other node. Each node has a Boolean measurement and we…
Let $M$ be an $n$-dimensional complex manifold. A holomorphic function $f:M\to \mathbb C$ is said to be semi-Bloch if for every $\lambda\in \mathbb C$ the function $g_\lambda=\exp(\lambda f(z))$ is normal on $M$. We characterise Semi-Bloch…
It was shown by Boukerrou et al.~[IACR Trans. Symmetric Cryptol. 1 (2020), 331--362] that the $F$-boomerang uniformity (which is the same as the second-order zero differential uniformity in even characteristic) of perfect nonlinear…
The Walsh--Hadamard spectrum of a bent function uniquely determines a dual function. The dual of a bent function is also bent. A bent function that is equal to its dual is called a self-dual function. The Hamming distance between a bent…
Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where…
Suppose that f is a boolean function from F_2^n to {0,1} with spectral norm (that is the sum of the absolute values of its Fourier coefficients) at most M. We show that f may be expressed as +/- 1 combination of at most 2^(2^(O(M^4)))…
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…
Given a compact space $X$, a commutative Banach algebra $A$, and an $A$-valued function algebra $\mathscr{A}$ on $X$, the notions of vector-valued spectrum of functions $f\in\mathscr{A}$ are discussed. The $A$-valued spectrum…
The work offers a new approach to the formation of functions which are used in cryptography and cryptanalysis. It will use alternative forms of representation of Boolean functions, that is, those which are different from the classical form,…
Consider a convex relaxation $\hat f$ of a pseudo-boolean function $f$. We say that the relaxation is {\em totally half-integral} if $\hat f(x)$ is a polyhedral function with half-integral extreme points $x$, and this property is preserved…
An algorithm for computing the nonlinearity of a Boolean function from its algebraic normal form (ANF) is proposed. By generalizing the expression of the weight of a Boolean function in terms of its ANF coefficients, a formulation of the…