Related papers: Simpler proof for nonlinearity of majority functio…
A recent breakthrough [Hirahara and Nanashima, STOC'2024] established that if $\mathsf{NP} \not \subseteq \mathsf{ioP/poly}$, the existence of zero-knowledge with negligible errors for $\mathsf{NP}$ implies the existence of one-way…
The Discrete Logarithm Problem is well-known among cryptographers, for its computational hardness that grants security to some of the most commonly used cryptosystems these days. Still, many of these are limited to a small number of…
A Boolean function in $n$ variables is rotation symmetric (RS) if it is invariant under powers of $\rho(x_1, \ldots, x_n) = (x_2, \ldots, x_n, x_1)$. An RS function is called monomial rotation symmetric (MRS) if it is generated by applying…
In this work, we leverage the Hamiltonian kind structure for accurate uncertainty propagation through a nonlinear dynamical system. The developed approach utilizes the fact that the stationary probability density function is purely a…
Nonlinearity parameter tomography leads to the problem of identifying a coefficient in a nonlinear wave equation (such as the Westervelt equation) modeling ultrasound propagation. In this paper we transfer this into frequency domain, where…
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 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…
A function f : {0, 1}^n -> {0, 1} is said to be k-monotone if it flips between 0 and 1 at most k times on every ascending chain. Such functions represent a natural generalization of (1-)monotone functions, and have been recently studied in…
We develop a simple and intuitive identity for calculating expectations of weighted $k$-fold sums over particles in branching processes, generalising the well-known many-to-one lemma.
Rotation symmetric Boolean functions are invariant under circular translation of indices. These functions have very rich cryptographic properties and have been used in different cryptosystems. Recently, Thomas Cusick proved that exponential…
Kummer's function, also known as the confluent hypergeometric function (CHF), is an important mathematical function, in particular due to its many special cases, which include the Bessel function, the incomplete Gamma function and the error…
Maximum nonlinear functions on finite fields are widely used in cryptography because the coordinate functions have large distance to linear functions. More precisely, the Hamming distance to the characteristic functions of hyperplanes is…
Items in a test are often used as a basis for making decisions and such tests are therefore required to have good psychometric properties, like unidimensionality. In many cases the sum score is used in combination with a threshold to decide…
We pursue a systematic study of the following problem. Let f:{0,1}^n -> {0,1} be a (usually monotone) Boolean function whose behaviour is well understood when the input bits are identically independently distributed. What can be said about…
The Bivariate Function Hard Problem (BFHP) has been in existence implicitly in almost all number theoretic based cryptosystems. This work defines the BFHP in a more general setting and produces an efficient asymmetric cryptosystem. The…
The nonlinear mass is a characteristic scale in halo formation that has wide-ranging applications across cosmology. Naively, computing it requires repeated numerical integration to calculate the variance of the power spectrum on different…
The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is…
We study the computational complexity of two Boolean nonlinearity measures: the nonlinearity and the multiplicative complexity. We show that if one-way functions exist, no algorithm can compute the multiplicative complexity in time…
A weight function which $q$-generalizes the ground state wave function of the multi-component Calogero-Sutherland quantum many body system is introduced. Conjectures, and some proofs in special cases, are given for a constant term identity…
We exhibit a linear threshold function in 5 variables with strictly smaller noise stability (for small values of the correlation parameter) than the majority function on 5 variables, thereby providing a counterexample to the "Majority is…