Counting rotation symmetric functions using Polyas theorem
Homogeneous rotation symmetric (invariant under cyclic permutation of the variables) Boolean functions have been extensively studied in recent years due to their applications in cryptography. In this paper we give an explicit formula for the number of homogeneous rotation symmetric functions over the finite field GF(pm) G F ( p m ) using Polyas enumeration theorem, which completely solves the open problem proposed by Yuan Li in 2008 2008 . This result simplifies the proof and the nonexplicit counting formula given by Shaojing Fu et al. over the field GF(p) G F ( p ) . This paper also gives an explicit count for n n -variable balanced rotation symmetric Boolean functions with n=pq n = p q , where p p and q q are distinct primes. Previous work only gave an explicit count for the case where n n is prime and lower bounds for the case where n n is a prime power.
polyas enumeration theorem rotation symmetric boolean functions balanced functions homogeneous functions