The graph structure of Chebyshev polynomials over finite fields and applications

Qureshi, Claudio; Panario, Daniel

doi:10.1007/s10623-018-0545-7

We completely describe the functional graph associated to iterations of Chebyshev polynomials over finite fields. Then, we use our structural results to obtain estimates for the average rho length, average number of connected components and the expected value for the period and preperiod of iterating Chebyshev polynomials.

Additional Metadata
Keywords	Chebyshev polynomials, Dynamical systems over finite fields, Permutation polynomials over finite fields
Persistent URL	doi.org/10.1007/s10623-018-0545-7
Journal	Designs, Codes and Cryptography
Organisation	School of Mathematics and Statistics
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Qureshi, C. (Claudio), & Panario, D. (2018). The graph structure of Chebyshev polynomials over finite fields and applications. Designs, Codes and Cryptography. doi:10.1007/s10623-018-0545-7

The graph structure of Chebyshev polynomials over finite fields and applications

Publication

Publication

The graph structure of Chebyshev polynomials over finite fields and applications

Publication

Publication

Workflow

Workflow

Add Content