Related papers: More Constructions of Differentially 4-uniform Per…
Building upon the observation that the newly defined~\cite{EFRST20} concept of $c$-differential uniformity is not invariant under EA or CCZ-equivalence~\cite{SPRS20}, we showed in~\cite{SG20} that adding some appropriate linearized…
Dillon-like Boolean functions are known, in the literature, to be those trace polynomial functions from $\mathbb{F}_{2^{2n}}$ to $\mathbb{F}_{2}$, with all the exponents being multiples of $2^n-1$ often called Dillon-like exponents. This…
Boolean functions with good cryptographic criteria when restricted to the set of vectors with constant Hamming weight play an important role in the recent FLIP stream cipher. In this paper, we propose a large class of weightwise perfectly…
Secure multi-party computation using a physical deck of cards, often called card-based cryptography, has been extensively studied during the past decade. Card-based protocols to compute various Boolean functions have been developed. As each…
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…
We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…
We provide an extensive study of the differential properties of the functions $x\mapsto x^{2^t-1}$ over $\F$, for $2 \leq t \leq n-1$. We notably show that the differential spectra of these functions are determined by the number of roots of…
In this work, we study functions that can be obtained by restricting a vectorial Boolean function $F \colon \mathbb{F}_2^n \rightarrow \mathbb{F}_2^n$ to an affine hyperplane of dimension $n-1$ and then projecting the output to an…
Negabent functions as a class of generalized bent functions have attracted a lot of attention recently due to their applications in cryptography and coding theory. In this paper, we consider the constructions of negabent functions over…
We study the problem of designing models for machine learning tasks defined on \emph{sets}. In contrast to traditional approach of operating on fixed dimensional vectors, we consider objective functions defined on sets that are invariant to…
In this paper, we introduce a pair of multiplication-like operations, $L_0$ and $L_1$, which derive $k$-regular functions from $(k+1)$-regular functions. The investigation of the inverse problem naturally leads to a deeper study of the…
Starting with the multiplication of elements in $\mathbb{F}_{q}^2$ which is consistent with that over $\mathbb{F}_{q^2}$, where $q$ is a prime power, via some identification of the two environments, we investigate the $c$-differential…
Finding balanced, highly nonlinear Boolean functions is a difficult problem where it is not known what nonlinearity values are possible to be reached in general. At the same time, evolutionary computation is successfully used to evolve…
This paper makes the first bridge between the classical differential/boomerang uniformity and the newly introduced $c$-differential uniformity. We show that the boomerang uniformity of an odd APN function is given by the maximum of the…
Dual feasible functions (DFFs) have been used to provide bounds for standard packing problems and valid inequalities for integer optimization problems. In this paper, the connection between general DFFs and a particular family of…
In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…
The flux reconstruction (FR) approach offers a flexible framework for describing a range of high-order numerical schemes; including nodal discontinuous Galerkin and spectral difference schemes. This is accomplished through the use of…
Rotation symmetric Boolean functions have important applications in the design of cryptographic algorithms. In this paper, the Conjecture about rotation symmetric Boolean functions (RSBFs) of degree 3 proposed by Cusik and St\u{a}nic\u{a}…
We study the most-informative Boolean function conjecture using a differential equation approach. This leads to a formulation of a functional inequality on finite-dimensional random variables. We also develop a similar inequality in the…
We determine a connection between the weight of a Boolean function and the total weight of its first-order derivatives. The relationship established is used to study some cryptographic properties of Boolean functions. We establish a…