Related papers: A note on APN permutations in even dimension
Recently, it was realized that anomalies can be completely classified by topological orders, symmetry protected topological (SPT) orders, and symmetry enriched topological orders in one higher dimension. The anomalies that people used to…
We systematically analyze a class of hexanomial functions over finite fields of characteristic $2$ proposed by Dillon (2006) as candidates for almost perfect nonlinear (APN) functions, significantly extending earlier partial-APN results.…
In a recent paper, it is shown that functions of the form $L_1(x^3)+L_2(x^9)$, where $L_1$ and $L_2$ are linear, are a good source for construction of new infinite families of APN functions. In the present work we study necessary and…
In a recent publication we have investigated the spectrum of anomalous dimensions for arbitrary composite operators in the critical N-vector model in 4-epsilon dimensions. We could establish properties like upper and lower bounds for the…
We show an equivalence between 1-query quantum algorithms and representations by degree-2 polynomials. Namely, a partial Boolean function $f$ is computable by a 1-query quantum algorithm with error bounded by $\epsilon<1/2$ iff $f$ can be…
Whether two distinct APN functions can have a Hamming distance of $1$ remains an open problem. In 2020, L. Budaghyan et al. introduced a new CCZ-invariant $\Pi_F$ which can be used to provide lower bounds on the Hamming distance between a…
We investigate permutation polynomials F over finite fields F_{p^n} whose generalized derivative maps x -> F(x + a) - cF(x) are themselves permutations for all nonzero shifts a. This property, termed perfect c-nonlinearity (PcN), represents…
Binary linear codes with good parameters have important applications in secret sharing schemes, authentication codes, association schemes, and consumer electronics and communications. In this paper, we construct several classes of binary…
The quantum N-dimensional orthogonal vector Cayley-Klein spaces with different combinations of quantum structure and Cayley-Klein scheme of contractions and analytical continuations are described for multipliers, which include the first and…
This note presents a short, transparent proof of the theorem that every Euclidean quadratic form over a normed integral domain is an Aubry-Davenport-Cassels form. The theorem, as formulated in the note, allows besides quadratic terms also…
In this paper we define a new (output) multiplicative differential, and the corresponding $c$-differential uniformity. With this new concept, even for characteristic $2$, there are perfect $c$-nonlinear (PcN) functions. We first…
A block cipher is intended to be computationally indistinguishable from a random permutation of appropriate domain and range. But what are the properties of a random permutation? By the aid of exponential and ordinary generating functions,…
This paper proves sharp lower bounds on a resonance counting function for obstacle scattering in even-dimensional Euclidean space without a need for trapping assumptions. Similar lower bounds are proved for some other compactly supported…
We give a geometric characterization of vectorial boolean functions with differential uniformity less or equal to 4.
Secure multi-party computation is an area in cryptography which studies how multiple parties can compare their private information without revealing it. Besides digital protocols, many unconventional protocols for secure multi-party…
Boolean functions on the space $F_{2}^m$ are not only important in the theory of error-correcting codes, but also in cryptography, where they occur in private key systems. In these two cases, the nonlinearity of these function is a main…
We construct an algebra of dimension $2^{\aleph_0}$ consisting only of functions which in no point possess a finite one-sided derivative. We further show that some well known nowhere differentiable functions generate algebras, which contain…
The work discusses equivariant asymptotic dimension (also known as "wide equivariant covers", "$N$-$\mathcal F$-amenability" or "amenability dimension", and "$d$-BLR condition") and its generalisation, transfer reducibility, which are…
The explicit computation of higher-point conformal blocks in any dimension is usually a challenging task. For two-dimensional conformal field theories in Euclidean signature, the oscillator formalism proves to be very efficient. We…
Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…