Search

The six infinite families of power APN functions are among the oldest known instances of APN functions, and it has been conjectured in 2000 that they exhaust all possible power APN functions. Another long-standing open problem is that of the Walsh spectrum of the Dobbertin power family, which is still unknown. Those of Kasami, Niho and Welch functions are known, but not the precise values of their Walsh transform, with rare exceptions. One promising approach that could lead to the resolution of these problems is to consider alternative representations of the functions in questions. We derive alternative representations for the infinite APN monomial families. We show how the Niho, Welch, and Dobbertin functions can be represented as the composition $x^{i} \circ x^{1/j}$ of two power functions, and prove that our representations are optimal, i.e. no two power functions of lesser algebraic degree can be used to represent the functions in this way. We investigate compositions $x^{i} \circ L \circ x^{1/j}$ for a linear polynomial $L$ , show how the Kasami functions in odd dimension can be expressed in this way with $i=j$ being a Gold exponent and compute all APN functions of this form for $n \le 9$ and for $L$ with binary coefficients, thereby showing that our theoretical constructions exhaust all possible cases. We present observations and data on power functions with exponent $\sum _{i = 1}^{k-1} 2^{2ni} - 1$ which generalize the inverse and Dobbertin families. We present data on the Walsh spectrum of the Dobbertin function for $n \le 35$ , and conjecture its exact form. As an application of our results, we determine the exact values of the Walsh transform of the Kasami function at all points of a special form. Computations performed for $n\leq 21$ show that these points cover about 2/3 of the field. [ABSTRACT FROM AUTHOR]

Copyright of Rad HAZU: Matematicke Znanosti is the property of Croatian Academy of Sciences & Arts (HAZU) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The binomial $B(x) = x^{3} + \beta x^{36}$ (where $\beta $ is primitive in $\mathbb {F}_{2^{2}}$) over $\mathbb {F}_{2^{10}}$ is the first known example of an Almost Perfect Nonlinear (APN) function that is not CCZ-equivalent to a power function, and has remained unclassified into any infinite family of APN functions since its discovery in 2006. We generalize this binomial to an infinite family of APN quadrinomials of the form $x^{3} + a (x^{2^{i}+1})^{2^{k}} + b x^{3 \cdot 2^{m}} + c (x^{2^{i+m}+2^{m}})^{2^{k}}$ from which $B(x)$ can be obtained by setting $a = \beta $ , $b = c = 0$ , $i = 3$ , $k = 2$. We show that for any dimension $n = 2m$ with $m$ odd and $3 \nmid m$ , setting $(a,b,c) = (\beta, \beta ^{2}, 1)$ and $i = m-2$ or $i = (m-2)^{-1} \mod n$ yields an APN function, and verify that for $n = 10$ the quadrinomials obtained in this way for $i = m-2$ and $i = (m-2)^{-1} \mod n$ are CCZ-inequivalent to each other, to $B(x)$ , and to any other known APN function over $\mathbb {F}_{2^{10}}$. [ABSTRACT FROM AUTHOR]

We investigate the differential properties of a vectorial Boolean function $G$ obtained by modifying an APN function $F$. This generalizes previous constructions where a function is modified at a few points. We characterize the APN-ness of $G$ via the derivatives of $F$ , and deduce an algorithm for searching for APN functions whose values differ from those of $F$ only on a given set $U \subseteq \mathbb {F}_{2^{n}}$. We introduce a value $\Pi _{F}$ associated with any $F$ , which is invariant under CCZ-equivalence. We express a lower bound on the distance between a given APN function $F$ and the closest APN function in terms of $\Pi _{F}$. We show how $\Pi _{F}$ can be computed efficiently for $F$ quadratic. We compute $\Pi _{F}$ for all known APN functions over $\mathbb {F}_{2^{n}}$ up to $n \le 8$. This is the first new CCZ-invariant for APN functions to be introduced within the last ten years. We derive a mathematical formula for this lower bound for the Gold function $F(x) = x^{3}$ , and observe that it tends to infinity with $n$. Finally, we describe how to efficiently find all sets $U$ such that, taking $G(x) = F(x) + v$ for $x \in U$ and $G(x) = F(x)$ for $x \notin U$ , $G(x)$ is APN. [ABSTRACT FROM AUTHOR]

Almost perfect nonlinear (APN) functions over fields of characteristic 2 play an important role in cryptography, coding theory and, more generally, mathematics and information theory. In this paper we deduce a new method for constructing APN functions by studying the isotopic equivalence, concept defined for quadratic planar functions in fields of odd characteristic. In particular, we construct a family of quadratic APN functions which provides a new example of an APN mapping over ${\mathbb F}_{2^{9}}$ and includes an example of another APN function $x^{9}+ \mathop {\mathrm {Tr}}\nolimits (x^{3})$ over ${\mathbb F}_{2^{8}}$ , known since 2006 and not classified up to now. We conjecture that the conditions for this family are satisfied by infinitely many APN functions. [ABSTRACT FROM AUTHOR]

We study the problem of existence of APN functions of algebraic degree n over {\mathbb F}_{2^{n}} . We characterize such functions by means of derivatives and power moments of the Walsh transform. We deduce several non-existence results which imply, in particular, that for most of the known APN functions F over \mathbb F2^{n} the function x^{2^{n}-1}+F(x) is not APN, and changing a value of $F$ in a single point then results in non-APN functions. This leads us to conjectures that an APN function modified in one point cannot remain APN and that there exists no APN function of algebraic degree $n$ . [ABSTRACT FROM AUTHOR]

In this paper, we discover that univariate form of a Niho bent function is a sum of functions having the form of a Leander–Kholosha bent function taken with particular coefficients from \mathbb F2^{n}^{*} for every term. We know that the Niho bent functions are related to o-polynomials. The power terms in the univariate Niho bent function can be derived by working, in a first step, on each monomial of the corresponding o-polynomial separately, and in a second step, adding them to obtain the global expression. This allows, knowing the monomials in an o-polynomial, to obtain the power terms of the polynomial representing corresponding bent function. However, the coefficients are not calculated explicitly. The explicit form is given for the bent functions obtained from quadratic and cubic o-polynomials. We also calculate the algebraic degree of any bent function in the Leander–Kholosha class. [ABSTRACT FROM AUTHOR]

We observe that the CCZ-equivalence of bent vectorial functions over $${{\bf F}_2^n}$$ ( n even) reduces to their EA-equivalence. Then we show that in spite of this fact, CCZ-equivalence can be used for constructing bent functions which are new up to EA-equivalence and therefore to CCZ-equivalence: applying CCZ-equivalence to a non-bent vectorial function F which has some bent components, we get a function F′ which also has some bent components and whose bent components are CCZ-inequivalent to the components of the original function F. Using this approach we construct classes of nonquadratic bent Boolean and bent vectorial functions. [ABSTRACT FROM AUTHOR]

An introduction is presented in which the editor discusses various reports within the issue on topics including cryptography, codes and Boolean functions.