RESULTS ON PERMUTATION SYMMETRIC BOOLEAN FUNCTIONS  

作　　者：ZHANG Yanjuan DENG Yingpu 

机构地区：[1]Key Laboratory of Mathematics Mechanization,NCMIS,Academy of Mathematics and Systems Science,Chinese Academy of Sciences

出　　处：《Journal of Systems Science & Complexity》2013年第2期302-312,共11页系统科学与复杂性学报（英文版）

基　　金：supported by the National Natural Science Foundation of China under Grant Nos.11071285 and 61121062;973 Project under Grant No.2011CB302401;the National Center for Mathematics and Interdisciplinary Sciences,Chinese Academy of Sciences

摘　　要：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）.

关 键 词：Bent functions block-symmetric ENUMERATION permutation symmetric Boolean functions rotation symmetric. 

分 类 号：O153.2[理学—数学] TU44[理学—基础数学]