Related papers: A new large class of functions not APN infinitely …
Let $L/K$ be a Galois extension of number fields. We prove two lower bounds on the maximum of the degrees of the irreducible complex representations of ${\rm Gal}(L/K)$, the sharper of which is conditional on the Artin Conjecture and the…
Inspired by a recent work of Mesnager, we present several new infinite families of quadratic ternary bent, near-bent and 2-plateaued functions from some known quadratic ternary bent functions. Meanwhile, the distribution of the Walsh…
We establish new Bombieri-Vinogradov type estimates for a wide class of multiplicative arithmetic functions and derive several applications, including: a new proof of a recent estimate by Drappeau and Topacogullari for arithmetical…
In this paper some cryptographic properties of Boolean functions, including weight, balancedness and nonlinearity, are studied, particularly focusing on splitting functions and cubic Boolean functions. Moreover, we present some quantities…
Ultrafunctions are a particular class of functions defined on a Non Archimedean field R^{*}\supset R. They have been introduced and studied in some previous works ([1],[2],[3]). In this paper we introduce a modified notion of ultrafunction…
The paper presents several combinatorial properties of the boolean cumulants. A corollary is a new proof of the multiplicative property of the boolean cumulant series that can be easily adapted for the case of boolean independence with…
Specific vectorial boolean functions, such as S-Boxes or APN functions have many applications, for instance in symmetric ciphers. In cryptography they must satisfy some criteria (balancedness, high nonlinearity, high algebraic degree,…
Almost perfect nonlinear (APN) functions on finite fields of characteristic two have been studied by many researchers. Such functions have useful properties and applications in cryptography, finite geometries and so on. However APN…
In this paper, we introduce and investigate a class P of continuous and periodic functions on R. The class P is defined so that second-order central differences of a function satisfy some concavity-type estimate. Although this definition…
The study of non-linearity (linearity) of Boolean function was initiated by Rothaus in 1976. The classical non-linearity of a Boolean function is the minimum Hamming distance of its truth table to that of affine functions. In this note we…
We investigate Boolean degree 1 functions for several classical association schemes, including Johnson graphs, Grassmann graphs, graphs from polar spaces, and bilinear forms graphs, as well as some other domains such as multislices (Young…
In this paper we show that PSPACE is equal to 4th level in the polynomial hierarchy. We also deduce a lot of important consequences. True quantified Boolean formula is a generalisation of the Boolean Satisfiability Problem, where…
Constructing permutation polynomials over finite fields, particularly those with simple algebraic structure in multiple variables, is a fundamental problem with applications in cryptography and coding theory. Recently, Li and Kaleyski (IEEE…
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…
We make the case for neural network objects and extend an already existing neural network calculus explained in detail in Chapter 2 on \cite{bigbook}. Our aim will be to show that, yes, indeed, it makes sense to talk about neural network…
In 2021, Calderini et al. introduced a construction for APN functions on $\mathbb{F}_{2^{2m}}$ in bivariate form $$ f(x,y)=\big(xy,\, x^{2^r+1} + x^{2^{r+m/2}} y^{2^{m/2}} + bxy^{2^r} + cy^{2^r+1}\big),\quad r < m/2,\quad \gcd(r, m) = 1. $$…
The algebraic degree of Boolean functions (or vectorial Boolean functions) is an important cryptographic parameter that should be computed by fast algorithms. They work in two main ways: (1) by computing the algebraic normal form and then…
Let $G$ be a nonabelian finite group and let $d$ be an irreducible character degree of $G$. Then there is a positive integer $e$ so that $|G| = d(d+e)$. Snyder has shown that if $e > 1$, then $|G|$ is bounded by a function of $e$. This…
It is stated that Boolean set algebras with unit V, where V is a union of Cartesian products, are axiomatizable. The axiomatization coincides with that of cylindric polyadic equality algebras (class CPE). This is an algebraic representation…
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…