Orthomorphic permutations have good characteristics in cryptosystems. In this paper, by using of knowledge about relation between orthomorphic permutations and multi-output functions, and conceptions of the generalize...Orthomorphic permutations have good characteristics in cryptosystems. In this paper, by using of knowledge about relation between orthomorphic permutations and multi-output functions, and conceptions of the generalized Walsh spectrum of multi-output functions and the auto-correlation function of multi-output functions to investigate the Walsh spectral characteristics and the auto-correlation function characteristics of orthormophic permutations, several results are obtained.展开更多
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 cryptog...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）.展开更多
基金Supported by State Key Laboratory of InformationSecurity Opening Foundation(01-02) .
文摘Orthomorphic permutations have good characteristics in cryptosystems. In this paper, by using of knowledge about relation between orthomorphic permutations and multi-output functions, and conceptions of the generalized Walsh spectrum of multi-output functions and the auto-correlation function of multi-output functions to investigate the Walsh spectral characteristics and the auto-correlation function characteristics of orthormophic permutations, several results are obtained.
基金supported by the National Natural Science Foundation of China under Grant Nos.11071285 and 61121062973 Project under Grant No.2011CB302401the 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）.
