Permutation Polynomials modulo m
| dc.creator | Li, Shujun | |
| dc.date | 2005-09-22 | |
| dc.date | 2005-12-01 | |
| dc.date.accessioned | 2026-07-07T06:43:06Z | |
| dc.date.available | 2026-07-07T06:43:06Z | |
| dc.description | This paper mainly studies problems about so called "permutation polynomials modulo $m$", polynomials with integer coefficients that can induce bijections over Z_m={0,...,m-1}. The necessary and sufficient conditions of permutation polynomials are given, and the number of all permutation polynomials of given degree and the number induced bijections are estimated. A method is proposed to determine all equivalent polynomials from the induced polynomial function, which can be used to determine all equivalent polynomials that induce a given bijection. A few problems have not been solved yet in this paper and left for open study. Note: After finishing the first draft, we noticed that some results obtained in this paper can be proved in other ways (see Remark 2). In this case, this work gives different and independent proofs of related results. | |
| dc.description | 21 pages, with 2 open problems | |
| dc.identifier | https://arxiv.org/abs/math/0509523 | |
| dc.identifier | http://arxiv.org/abs/math/0509523 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/102287 | |
| dc.subject | Number Theory | |
| dc.subject | Cryptography and Security | |
| dc.title | Permutation Polynomials modulo m | |
| dc.type | text |