Resumen de Sequences of numbers via permutation polynomials over some finite rings

G. R. Vadiraja Bhatta, B. R. Shankar, Vishnu Narayan Mishra, Prasanna Poojary

• 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.