The Graph Structure of Chebyshev Permutation Polynomials over Ring $\mathbb{Z}_{p^k}$
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913513189933056 |
|---|---|
| author | Li, Chengqing Lu, Xiaoxiong Tan, Kai Chen, Guanrong |
| author_facet | Li, Chengqing Lu, Xiaoxiong Tan, Kai Chen, Guanrong |
| contents | Understanding the underlying graph structure of a nonlinear map over a particular domain is essential in evaluating its potential for real applications. In this paper, we investigate the structure of the associated \textit{functional graph} of Chebyshev permutation polynomials over a ring $\mathbb{Z}_{p^k}$, with $p$ being a prime number greater than three, where every number in the ring is considered as a vertex and the existing mapping relation between two vertices is regarded as a directed edge. Based on some new properties of Chebyshev polynomials and their derivatives, we disclose how the basic structure of the functional graph evolves with respect to parameter $k$. First, we present a complete and explicit form of the length of a path starting from any given vertex. Then, we show that the strong patterns of the functional graph that the number of cycles of any given length always remains constant as $k$ increases. Moreover, we rigorously prove the rules on the elegant structure of the functional graph and verify them experimentally. Our results could be useful for studying the emergence of the complexity of a nonlinear map in digital computers and security analysis of its cryptographic applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2209_14658 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | The Graph Structure of Chebyshev Permutation Polynomials over Ring $\mathbb{Z}_{p^k}$ Li, Chengqing Lu, Xiaoxiong Tan, Kai Chen, Guanrong Chaotic Dynamics 94A55 Understanding the underlying graph structure of a nonlinear map over a particular domain is essential in evaluating its potential for real applications. In this paper, we investigate the structure of the associated \textit{functional graph} of Chebyshev permutation polynomials over a ring $\mathbb{Z}_{p^k}$, with $p$ being a prime number greater than three, where every number in the ring is considered as a vertex and the existing mapping relation between two vertices is regarded as a directed edge. Based on some new properties of Chebyshev polynomials and their derivatives, we disclose how the basic structure of the functional graph evolves with respect to parameter $k$. First, we present a complete and explicit form of the length of a path starting from any given vertex. Then, we show that the strong patterns of the functional graph that the number of cycles of any given length always remains constant as $k$ increases. Moreover, we rigorously prove the rules on the elegant structure of the functional graph and verify them experimentally. Our results could be useful for studying the emergence of the complexity of a nonlinear map in digital computers and security analysis of its cryptographic applications. |
| title | The Graph Structure of Chebyshev Permutation Polynomials over Ring $\mathbb{Z}_{p^k}$ |
| topic | Chaotic Dynamics 94A55 |
| url | https://arxiv.org/abs/2209.14658 |