文献类型：会议论文

英文题名：Construction and count on linear orthomorphic permutations based on m sequence

作者：Du, Jiao[1,2]; Wen, Qiao-Yan[1]; Liao, Xin[1]; Zhang, Jie[3]; Song, Shou-Chao[3]

第一作者：杜蛟;Du, Jiao

通讯作者：Du, J.

机构：[1] State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China; [2] Department of Mathematics, Xinxiang University, Henan Xinxiang 453003, China; [3] School of Science, Beijing University of Posts and Telecommunications, Beijing 100876, China

第一机构：State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China

会议论文集：Proceedings - 2011 International Conference on Computational and Information Sciences, ICCIS 2011

会议日期：October 21, 2011 - October 23, 2011

会议地点：Chengdu, Sichuan, China

语种：英文

外文关键词：Shift registers

摘要：The orthomorphic permutation is a kind of one-to-one mapping from to F 2n to F2n. Orthomorphic permutations can be used in the constructions of nonlinear permutations in the cipher systems. In this paper, we show how to construct linear orthomorphic permutations by utilizing the trinomial property of m sequences. In our method, we only use m sequence, we can obtain all the maximal linear orthomorphic permutations and other linear orthomorphic permutations on FF2n, and this method can be implemented simply and easily. ? 2011 IEEE.