一类基于m-序列的正形置换的构造与计数

A New Class Construction of Orthomorphic Permutations Based on m-Sequences

正形置换在密码学中有着广泛的应用,利用m-序列的"三项式特性",给出了一个构造n元正形置换的新方法,该方法既不同于已有的由n-2元构造n元正形置换,也不同于基于正交拉丁方的由n元构造n+1元正形置换的方法.

Orthomorphic permutations have important application in cryptography, based on the trinomial property of m-sequence,we get a new method to construct Orthomorphic permutations,these constructions are different from other existing methods, such as n-bit orthomorphic permutations are constructed from a n-2-bit,or from a n-bit to a n＋1-bit based on orthomorphic Latin square.