Results on permutation symmetric Boolean functions

This paper provides a systematic method on the enumeration of various permutation symmetric Boolean functions. The results play a crucial role on the search of permutation symmetric Boolean functions with good cryptographic properties. The proposed method is algebraic in nature. As a by-product, the authors correct and generalize the corresponding results of St?nic? and Maitra (2008). Further, the authors give a complete classification of block-symmetric bent functions based on the results of Zhao and Li (2006), and the result is the only one classification of a certain class of permutation symmetric bent functions after the classification of symmetric bent functions proposed by Savicky (1994).