Paper Info
Title
The Graph Structure of Chebyshev Polynomials over Finite Fields and Applications.
Abstract
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.
Year
DOI
Venue
2019
10.1007/s10623-018-0545-7
Designs, Codes and Cryptography
Keywords
DocType
Volume
Chebyshev polynomials, Dynamical systems over finite fields, Permutation polynomials over finite fields, 12E20, 11T06, 11T71
Journal
abs/1803.06539
Issue
ISSN
Citations 
SP2-3
0925-1022
1
PageRank 
References 
Authors
0.37
7
2
Name
Order
Citations
PageRank
Claudio Qureshi1104.48
Daniel Panario243863.88