Balanced Symmetric Functions over GF(p)GF(p)

Under mild conditions on $n,p$, we give a lower bound on the number of $n$-variable balanced symmetric polynomials over finite fields $GF(p)$, where $p$ is a prime number. The existence of nonlinear balanced symmetric polynomials is an immediate corollary of this bound. Furthermore, we conjecture that $X(2^t,2^{t+1}l-1)$ are the only nonlinear balanced elementary symmetric polynomials over GF(2), where $X(d,n)=\sum_{i_1<i_2<...<i_d}x_{i_1} x_{i_2}... x_{i_d}$, and we prove various results in support of this conjecture.Comment: 21 page

Enumeration of Balanced Symmetric Functions over GF(p)

It is proved that the construction and enumeration of the number of balanced symmetric functions over GF(p) are equivalent to solving an equation system and enumerating the solutions. Furthermore, we give an lower bound on number of balanced symmetric functions over GF(p), and the lower bound provides best known results

Improved lower bound on the number of balanced symmetric functions over GF(p)

The lower bound on the number of n-variable balanced symmetric functions over finite fields GF(p) presented in {\cite{Cusick}} is improved in this paper

Strict Avalanche Criterion Over Finite Fields

Boolean functions on $GF(2)$ which satisfy the Strict Avalanche Criterion ($SAC$) play an important role in the art of information security. In this paper, we extend the conception $SAC$ to finite fields $GF(p)$. A necessary and sufficient condition is given by using spectral analysis. Also, based on an interesting permutation polynomial theorem, we prove various facts about ($n-1$)-th order $SAC$ functions on $GF(p)$. We also construct many such functions