Related papers: Borne sur le degr\'e des polyn\^omes presque parfa…
A key property of an algebraic variety is whether it is absolutely irreducible, meaning that it remains irreducible over the algebraic closure of its defining field, and determining absolute irreducibility is important in algebraic geometry…
Let $p>3$ be a prime. We show that, for each integer $d$ with $p \leq d \leq 2(p-1)$, there exists a generalized almost perfect nonlinear (GAPN) binomial or trinomial over $\mathbb{F}_{p^2}$ of algebraic degree $d$. We start by deriving…
The approximate degree of a Boolean function $f \colon \{-1, 1\}^n \rightarrow \{-1, 1\}$ is the least degree of a real polynomial that approximates $f$ pointwise to error at most $1/3$. We introduce a generic method for increasing the…
We prove a necessary condition for some polynomials of degree 4e (e an odd number) to be APN over F q n for large n, and we investigate the polynomials f of degree 12.
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…
Polynomial representations of Boolean functions over various rings such as $\mathbb{Z}$ and $\mathbb{Z}_m$ have been studied since Minsky and Papert (1969). From then on, they have been employed in a large variety of fields including…
We show (almost) separation between certain important classes of Boolean functions. The technique that we use is to show that the total influence of functions in one class is less than the total influence of functions in the other class. In…
We introduce a new algebraic proof system, which has tight connections to (algebraic) circuit complexity. In particular, we show that any super-polynomial lower bound on any Boolean tautology in our proof system implies that the permanent…
We introduce and analyze a novel class of binary operations on finite-dimensional vector spaces over a field K, defined by second-order multilinear expressions with linear shifts. These operations generate polynomials whose degree increases…
In the independent works by Kalgin and Idrisova and by Beierle, Leander and Perrin, it was observed that the Gold APN functions over $\mathbb{F}_{2^5}$ give rise to a quadratic APN function in dimension 6 having maximum possible linearity…
Recently, the Walsh spectrum and boomerang properties of special power functions have aroused widespread research interest, owing to their important applications in cryptography and information security. In particular, locally-APN functions…
Vectorial Boolean functions are crucial building blocks in symmetric ciphers. Different known attacks on block ciphers have resulted in diverse cryptographic criteria of vectorial Boolean functions,such as differential distribution table…
The tree-width of a multivariate polynomial is the tree-width of the hypergraph with hyperedges corresponding to its terms. Multivariate polynomials of bounded tree-width have been studied by Makowsky and Meer as a new sparsity condition…
In this paper, by the Hasse-Weil bound, we determine the necessary and sufficient condition on coefficients $a_1,a_2,a_3\in\mathbb{F}_{2^n}$ with $n=2m$ such that $f(x) = {x}^{3\cdot2^m} + a_1x^{2^{m+1}+1} + a_2 x^{2^m+2} + a_3x^3$ is an…
We present new algorithms to compute fundamental properties of a Boolean function given in truth-table form. Specifically, we give an O(N^2.322 log N) algorithm for block sensitivity, an O(N^1.585 log N) algorithm for `tree decomposition,'…
Boolean functions with high algebraic immunity are important cryptographic primitives in some stream ciphers. In this paper, two methodologies for constructing binary minimal codes from sets, Boolean functions and vectorial Boolean…
We consider the problem of representing Boolean functions exactly by "sparse" linear combinations (over $\mathbb{R}$) of functions from some "simple" class ${\cal C}$. In particular, given ${\cal C}$ we are interested in finding…
The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. Approximate degree is known to be a lower bound on quantum query complexity. We resolve or nearly…
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…
Linear codes generated by component functions of perfect nonlinear (PN) and almost perfect nonlinear (APN) functions and the first-order Reed-Muller codes have been an object of intensive study in coding theory. The objective of this paper…