Generalised linear orthomorphic permutations

Abstract

The concept of generalised orthomorphic permutations over the Galois field Fnq is proposed on the basis of the original concept with regard to orthomorphic permutations over the Galois field Fn2 in this scientific research paper. At the same time, the enumeration formula of the total generalised linear orthomorphic permutations over the Galois field Fnq is given. It is worth noting that the Galois field Fnq possesses the prime subfield Fp with an arbitrary prime number as the characteristic. The local creating algorithm is obtained and generates the partial generalised linear orthomorphic permutations over the Galois general field Fnq. Consequently the existing and innovative enumeration formula involved linear orthomorphic permutations over a Galois field with characteristic two happens to be a special case to contain in our novel fruits over the general field. In the field of information security, the generalised linear orthomorphic permutations have been thoroughly discussed and generated far and wide for the design of the p-permutation in the diffusion layer of iterative round function involving an unbreakable cryptosystem. Finally we can obtain some generalised linear orthomorphic permutations with the greatest branch number in this research paper.