相关论文: On Finding the Eigenvalues of the Matrix of Rotati…

Homogeneous rotation symmetric Boolean functions have been extensively studied in recent years because of their applications in cryptography. Little is known about the basic question of when two such functions are affine equivalent. The…

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…

Fix positive numbers $\alpha$ and $\beta$. For the family of doubly cyclic matrices of the form $diag(a_1, a_2, ... ,a_n) - diag(b_1, b_2, ... ,b_n) \Sigma_*$, where $\Sigma_*$ is a permutation matrix for the $n$-cycle $1 \to 2$, $2 \to 3$,…

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…

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…

Let $1$ be the all-one vector and $\odot$ denote the component-wise multiplication of two vectors in $\mathbb F_2^n$. We study the vector space $\Gamma_n$ over $\mathbb F_2$ generated by the functions $\gamma_{2k}:\mathbb F_2^n \to \mathbb…

Let R_n be the ring of coinvariants for the diagonal action of the symmetric group S_n. It is known that the character of R_n as a doubly-graded S_n module can be expressed using the Frobenius characteristic map as \nabla e_n, where e_n is…

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…

Symmetric polynomials of the roots of a polynomial can be written as polynomials of the coefficients, and by applying this to the characteristic polynomial we can write a symmetric polynomial of the eigenvalues $a_{i}$ of an $n\times n$…

Let $D_n$ denote the set of monotone Boolean functions with $n$ variables. Elements of $D_n$ can be represented as strings of bits of length $2^n$. Two elements of $D_0$ are represented as 0 and 1 and any element $g\in D_n$, with $n>0$, is…

Circulant matrices are an important tool widely used in coding theory and cryptography. A circulant matrix is a square matrix whose rows are the cyclic shifts of the first row. Such a matrix can be efficiently stored in memory because it is…

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}…

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…

A substitution box (S-box) in a symmetric primitive is a mapping $F$ that takes $k$ binary inputs and whose image is a binary $m$-tuple for some positive integers $k$ and $m$, which is usually the only nonlinear element of the most modern…

Define a $(n^4+n^2)/2\times (n^4+n^2)/2$ symmetric $B$. $(ij)(kl)$ is an index where $i,j,k,l\in [n]$, $(ab)$ is an unordered pair and $(kl)$ is an ordered pair when $i\neq j$, otherwise it is also an unordered pair. $B((ij)(kl),(ab)(xy))$…

We begin by showing that any $n \times n$ matrix can be decomposed into a sum of $n$ circulant matrices with periodic relaxations on the unit circle. This decomposition is orthogonal with respect to a Frobenius inner product, allowing…

We present a new algorithm for solving an eigenvalue problem for a real symmetric matrix which is a rank-one modification of a diagonal matrix. The algorithm computes each eigenvalue and all components of the corresponding eigenvector with…

Let $R(r,n)$ be the $r$th order Reed-Muller code of length $2^n$. The affine linear group $\text{AGL}(n,\Bbb F_2)$ acts naturally on $R(r,n)$. We derive two formulas concerning the number of orbits of this action: (i) an explicit formula…

We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…

In Part 1 we study the spherical functions on compact symmetric pairs of arbitrary rank under a suitable multiplicity freeness assumption and additional conditions on the branching rules. The spherical functions are taking values in the…