Related papers: Affine equivalence of cubic homogeneous rotation s…
In this paper, we investigate permutation rotation-symmetric (shift-invariant) vectorial Boolean functions on $n$ bits that are liftings from Boolean functions on $k$ bits, for $k\leq n$. These functions generalize the well-known map used…
Affine equivalent classes of Boolean functions have many applications in modern cryptography and circuit design. Previous publications have shown that affine equivalence on the entire space of Boolean functions can be computed up to 10…
Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where…
It has been conjectured that there are no homogeneous rotation symmetric bent Boolean functions of degree greater than two. In this paper we begin by proving that sums of short-cycle rotation symmetric bent Boolean functions must contain a…
We consider the action on $\mathbb{F}_2^n$ by cyclic permutations ($\mathbb{Z}/n\mathbb{Z}$). Two elements $x, y\in \mathbb{F}_2^n$ are in the same orbit if they are cyclic shifts of each other. Cryptographic properties of rotation…
Let $f_n(x_0, x_1, \ldots, x_{n-1})$ denote the algebraic normal form (polynomial form) of a rotation symmetric (RS) Boolean function of degree $d$ in $n \geq d$ variables and let $wt(f_n)$ denote the Hamming weight of this function. Let…
Rotation symmetric Boolean functions have important applications in the design of cryptographic algorithms. In this paper, the Conjecture about rotation symmetric Boolean functions (RSBFs) of degree 3 proposed by Cusik and St\u{a}nic\u{a}…
We investigate classification results for general quadratic functions on torsion abelian groups. Unlike the previously studied situations, general quadratic functions are allowed to be inhomogeneous or degenerate. We study the discriminant…
Let $(0, a_1, \ldots, a_{d-1})_n$ denote the function $f_n(x_0, x_1, \ldots, x_{n-1})$ of degree $d$ in $n$ variables generated by the monomial $x_0x_{a_1} \cdots x_{a_{d-1}}$ and having the property that $f_n$ is invariant under cyclic…
Rotation symmetric Boolean functions represent an interesting class of Boolean functions as they are relatively rare compared to general Boolean functions. At the same time, the functions in this class can have excellent properties, making…
A Boolean function in $n$ variables is rotation symmetric (RS) if it is invariant under powers of $\rho(x_1, \ldots, x_n) = (x_2, \ldots, x_n, x_1)$. An RS function is called monomial rotation symmetric (MRS) if it is generated by applying…
We discuss the second-order differential uniformity of vectorial Boolean functions. The closely related notion of second-order zero differential uniformity has recently been studied in connection to resistance to the boomerang attack. We…
We study equivariant affine embeddings of homogeneous spaces and their equivariant automorphisms. An example of a quasiaffine, but not affine, homogeneous space with finitely many equivariant automorphisms is presented. We prove the…
Boolean functions with good cryptographic properties like high nonlinearity and algebraic degree play an important in the security of stream and block ciphers. Such functions may be designed, for instance, by algebraic constructions or…
Let $f_n(x_1, x_2, \ldots, x_n)$ denote the algebraic normal form (polynomial form) of a rotation symmetric Boolean function of degree $d$ in $n \geq d$ variables and let $wt(f_n)$ denote the Hamming weight of this function. Let $(1, a_2,…
In the literature, there are many results about permutation polynomials over finite fields. However, very few permutations of vector spaces are constructed although it has been shown that permutations of vector spaces have many applications…
Rotation symmetric Boolean functions are invariant under circular translation of indices. These functions have very rich cryptographic properties and have been used in different cryptosystems. Recently, Thomas Cusick proved that exponential…
Nonlinearity of rotation symmetric Boolean functions is an important topic on cryptography algorithm. Let $e\ge 1$ be any given integer. In this paper, we investigate the following question: Is the nonlinearity of the quartic rotation…
Finding permutation polynomials with low differential and boomerang uniformityis an important topic in S-box designs of many block ciphers. For example, AES chooses the inverse function as its S-box, which is differentially 4-uniform and…
Idempotent Boolean functions form a highly structured subclass of Boolean functions that is closely related to rotation symmetry under a normal-basis representation and to invariance under a fixed linear map in a polynomial basis. These…