Counting rotation symmetric functions using Polya's theorem
Publication Type:Journal Article
Source:Discrete Applied Mathematics, Elsevier, Volume 169, p.162-167 (2014)
Keywords:Balanced functions, Boolean functions, Cyclic permutations, Explicit formula, Finite element method, Homogeneous functions, Homogeneous rotations, Polya's enumeration theorem, Rotation, Rotation symmetric, Rotation symmetric boolean functions
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) using Polya's enumeration theorem, which completely solves the open problem proposed by Yuan Li in 2008. This result simplifies the proof and the nonexplicit counting formula given by Shaojing Fu et al. over the field GF(p). This paper also gives an explicit count for n-variable balanced rotation symmetric Boolean functions with n=pq, where p and q are distinct primes. Previous work only gave an explicit count for the case where n is prime and lower bounds for the case where n is a prime power.
cited By (since 1996)0
Cite this Research Publication
Dr. Lakshmy K. V., Sethumadhavan, M., and Cusick, T. W., “Counting rotation symmetric functions using Polya's theorem”, Discrete Applied Mathematics, vol. 169, pp. 162-167, 2014.