Abstract :
In this paper, we generalize the recent counting results about rotation symmetric Boolean functions to the rotation symmetric polynomials over finite fields GF(p). By using Möbius function, we obtain some formulas for more general n, the number of variables. Some known formula in Boolean case are simplified.
Keywords :
finite fields , polynomials , Euler function , Principle of inclusion and exclusion , cryptography , Rotation symmetry , Boolean function , M?bius function
