Sequences of numbers via permutation polynomials over some finite rings

Simple item page
dc.contributor.authorBhatta G.R.V.
dc.contributor.authorShankar B.R.
dc.contributor.authorMishra V.N.
dc.contributor.authorPoojary P.
dc.date.accessioned2021-05-05T10:31:02Z
dc.date.available2021-05-05T10:31:02Z
dc.date.issued2020
dc.description.abstractA 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. Random number generation plays a major role in cryptography and hence permutation polynomials may be used as random number generators. © 2020. All rights reserved.en_US
dc.identifier.citationProyecciones Vol. 19 , 1 , p. 1295 - 1313en_US
dc.identifier.urihttps://doi.org/10.22199/issn.0717-6279-2020-05-0079
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/16612
dc.titleSequences of numbers via permutation polynomials over some finite ringsen_US
dc.typeArticleen_US

Files

Collections

1. Journal Articles