The graph structure of Chebyshev polynomials over finite fields and applications

DOI10.1007/S10623-018-0545-7MaRDI QIDQ1727357zbMATH OpenOpenAlexFDO

Authors Claudio Qureshi, Daniel Panario

Publication date 20 February 2019

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1803.06539

zbMATH Keywords

Chebyshev polynomialspermutation polynomials over finite fieldsdynamical systems over finite fields

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite fields (field-theoretic aspects) (12E20)

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.

Recommendations

• Chebyshev polynomials and elliptic curves over finite fields
• Towards the definition of generalized Chebyshev polynomials over finite fields
• A trigonometric approach for Chebyshev polynomials over finite fields
• Tangent-Chebyshev maps over finite fields: new properties and functional graphs
• Functional graphs of polynomials over finite fields
• On the Chebotarëv theorem over finite fields
• Chebyshev mappings of finite fields
• The quadratic digraph on polynomial rings over finite fields
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• On the equational graphs over finite fields

Cites work

• scientific article; zbMATH DE number 16479 (Why is no real title available?)
• scientific article; zbMATH DE number 732318 (Why is no real title available?)
• A Simple Unpredictable Pseudo-Random Number Generator
• A monte carlo method for factorization
• Chebyshev action on finite fields
• Cycle structure of iterating Rédei functions
• Dickson polynomials that are involutions
• Dynamical structures of Chebyshev polynomials on \(\mathbb{Z}_2\)
• Handbook of finite fields
• Involutions Over the Galois Field
• Monte Carlo Methods for Index Computation (mod p)
• On the cycle structure of repeated exponentiation modulo a prime
• On the iteration of certain quadratic maps over GF(\(p\)).
• On the iterations of certain maps \(X \mapsto K \cdot(X + X^{- 1})\) over finite fields of odd characteristic
• Rédei Actions on Finite Fields and Multiplication Map in Cyclic Group

Cited in

(15)

• On functional graphs of quadratic polynomials
• Tangent-Chebyshev maps over finite fields: new properties and functional graphs
• Rédei permutations with the same cycle structure
• Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids
• A Graph-Based Unified Technique for Computing and Representing Coefficients over Finite Fields
• Chebyshev mappings of finite fields
• Dynamically affine maps in positive characteristic
• On the functional graph of the power map over finite groups
• The functional graph of linear maps over finite fields and applications
• On the heuristic of approximating polynomials over finite fields by random mappings
• Dynamics of polynomial maps over finite fields
• On the functional graph of \(f(X)=c(X^{q+1} + aX^2)\) over quadratic extensions of finite fields
• A Note on the Insecurity of Cryptosystems Based on Chebyshev Polynomials
• Digraphs of power maps over finite nilpotent groups
• Dynamics of the \(a\)-map over residually finite Dedekind domains and applications

This page was built for publication: The graph structure of Chebyshev polynomials over finite fields and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1727357)