A polynomial can represent every function from a finite field to itself. The functions which are also permutations of the field give rise to permutation polynomials, which have potential applications in cryptology and coding theory. Permutation polynomials over finite rings are studied with respect to the sequences they generate. The sequences obtained through some permutation polynomials are tested for randomness by carrying out known statistical tests.
6 January 2024 in Discrete Mathematics, Algorithms and Applications
Permutation is a natural phenomenon useful for understanding and explaining the structural and functional behavior of objects or concepts. The mathematical formulation of permutation behavior can be readily achieved by permutation polynomials. Permutation polynomials are constructed by suitably modifying linearized polynomials and associated affine polynomials with the help of additive characters, multiplicative characters, and special types of Trace functions for the polynomials in one and more than one indeterminates. The permutation properties of the obtained polynomials are verified using the AGW criterion.