![](/jspui/image/dspace_header.jpg)
Please use this identifier to cite or link to this item:
https://idr.nitk.ac.in/jspui/handle/123456789/16612
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bhatta G.R.V. | |
dc.contributor.author | Shankar B.R. | |
dc.contributor.author | Mishra V.N. | |
dc.contributor.author | Poojary P. | |
dc.date.accessioned | 2021-05-05T10:31:02Z | - |
dc.date.available | 2021-05-05T10:31:02Z | - |
dc.date.issued | 2020 | |
dc.identifier.citation | Proyecciones Vol. 19 , 1 , p. 1295 - 1313 | en_US |
dc.identifier.uri | https://doi.org/10.22199/issn.0717-6279-2020-05-0079 | |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/16612 | - |
dc.description.abstract | 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. 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.title | Sequences of numbers via permutation polynomials over some finite rings | en_US |
dc.type | Article | en_US |
Appears in Collections: | 1. Journal Articles |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.