Characterization and Counting for Maximal Linear Orthomorphisms Permutations
Li Zhi · Gongcheng shuxue xuebao · 2002
Maximal linear orthomorphism permutations can be used in the constructions for non-linear permutations in the cipher system. The characterization of and a counting formula for maximal linear orthomorphisms permutations are obtained by using polynomial theory in the finite fields. Furthermore, combining some conclusions of Mittenthal, the constructive problem for maximal linear orthormorphism permutations are also solved in theory.