有限域F_q～n上的广义线性正形置换计数  

Numeration of generalized linear orthomorphisms over the galois field F_q～n

作　　者：韩海清[1] 张焕国[2] 

机构地区：[1]湖北理工学院数理学院,湖北黄石435003 [2]武汉大学计算机学院,湖北武汉430072

出　　处：《北京交通大学学报》2013年第5期123-127,共5页JOURNAL OF BEIJING JIAOTONG UNIVERSITY

基　　金：有理分式公钥密码构造理论研究资助项目(60970115);湖北理工学院校级项目资助(801-8852)

摘　　要：有限域上的正形置换具有良好密码学性质,被广泛应用.本文推广了正形置换的概念,得到了一般有限域上广义线性正形置换的计数公式和部分广义线性正形置换的生成算法.以2为特征的有限域上线性正形置换计数公式是本文公式的特例.本文生成的广义线性正形置换用于设计P-置换时,分支数可以达到最优.The orthomorphisms have good cryptologic properties on the finite field and are widely used. This paper generalizes the concept of orthomorphisms, and obtains the counting formula on the generalized linear orthomorphisms over the Galois field with the arbitrary prime number pas the characteristic and the partial generation algorithm of generalized linear orthomorphisms. The counting formula of the linear orthomorphisms over the finite field with characteristic 2 is the spe- cial case in this paper. Furthermore, the generalized linear orthomorphisms that this paper has generated can gain the maximum branch number when they are designed as P-permutations.

关 键 词：分组密码 P-置换 有限域 广义线性正形置换 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]