Search arXivSearch

arXiv · 2005.10788

A note on the properties of associated Boolean functions of quadratic APN functions

Abstract

Let $F$ be a quadratic APN function of $n$ variables. The associated Boolean function $γ_F$ in $2n$ variables ($γ_F(a,b)=1$ if $a\neq{\bf 0}$ and equation $F(x)+F(x+a)=b$ has solutions) has the form $γ_F(a,b) = Φ_F(a) \cdot b + φ_F(a) + 1$ for appropriate functions $Φ_F:\mathbb{F}_2^n\to \mathbb{F}_2^n$ and $φ_F:\mathbb{F}_2^n\to \mathbb{F}_2$. We summarize the known results and prove new ones regarding properties of $Φ_F$ and $φ_F$. For instance, we prove that degree of $Φ_F$ is either $n$ or less or equal to $n-2$. Based on computation experiments, we formulate a conjecture that degree of any component function of $Φ_F$ is $n-2$. We show that this conjecture is based on two other conjectures of independent interest.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anastasiya Gorodilova. 2020-05-21. A note on the properties of associated Boolean functions of quadratic APN functions. https://doi.org/10.17223/20710410%2F47%2F2

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Factorisability of Low Dimensional Non-Negative Integer Matrices

We consider the problem of determining if a given two-dimensional nonnegative integer matrix $M$ is the product of two such matrices, excluding trivial units. A matrix $M$ with no such factorisation is called prime and therefore belongs to the minimal (infinite rank) generator of $2 \times 2$ matrices over the natural numbers, otherwise it is called composite. We also consider the problem of finding a (non-unique) factorisation of a composite matrix. Our results have applications in computational group theory and the theory of codes, where such matrices are called incidence matrices. We analyse the complexity of primality and finding a factorisation for a composite matrix, providing a first efficient algorithm.

cs.DM

Three Hardness Results for Graph Similarity Problems

Notions of graph similarity provide alternative perspective on the graph isomorphism problem and vice-versa. In this paper, we consider measures of similarity arising from mismatch norms as studied in Gervens and Grohe: the edit distance $δ_{\mathcal{E}}$, and the metrics arising from $\ell_p$-operator norms, which we denote by $δ_p$ and $δ_{|p|}$. We address the following question: can these measures of similarity be used to design polynomial-time approximation algorithms for graph isomorphism? We show that computing an optimal value of $δ_{\mathcal{E}}$ is \NP-hard on pairs of graphs with the same number of edges. In addition, we show that computing optimal values of $δ_p$ and $δ_{|p|}$ is \NP-hard even on pairs of $1$-planar graphs with the same degree sequence and bounded degree. These two results improve on previous known ones, which did not examine the restricted case where the pairs of graphs are required to have the same number of edges. Finally, we study similarity problems on strongly regular graphs and prove some near optimal inequalities with interesting consequences on the computational complexity of graph and group isomorphism.

cs.DM