Sequences of numbers via permutation polynomials over some finite rings

• Bhatta , G. R. Vadiraja ; Shankar, B. R. ^[1] ; Mishra, Vishnu Narayan ^[2] ; Poojary, Prasanna ^[3]
  1. [1] National Institute Of Technology

     National Institute Of Technology

     Japón

     
  2. [2] Indira Gandhi National Tribal University

     Indira Gandhi National Tribal University

     India

     
  3. [3] Manipal Academy of Higher Education.

  Mostrar afiliaciones +
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 39, Nº. 5, 2020, págs. 1295-1313
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

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