The graph structure of Chebyshev polynomials over finite fields and applications

1. Blum L., Blum M., Shub M.: A simple unpredictable pseudo-random number generator. SIAM J. Comput. 15(2), 364–383 (1986).

   Article  MathSciNet  MATH  Google Scholar 

2. Charpin P., Mesnager S., Sarkar S.: Dickson polynomials that are involutions. Contemporary Developments in Finite Fields and Applications, pp. 22–47. World Scientific, Singapore (2016).

   Chapter  Google Scholar 

3. Charpin P., Mesnager S., Sarkar S.: Involutions over the Galois field \({\mathbb{F}}_{2^n}\). IEEE Trans. Inf. Theory 62, 2266–2276 (2016).

   Article  MATH  Google Scholar 

4. Chou W., Shparlinski I.E.: On the cycle structure of repeated exponentiation modulo a prime. J. Number Theory 107, 345–356 (2004).

   Article  MathSciNet  MATH  Google Scholar 

5. Fan S., Liao L.: Dynamical structures of Chebyshev polynomials on \(\mathbb{Z}_2\). J. Number Theory 169, 174–182 (2016).

   Article  MathSciNet  MATH  Google Scholar 

6. Flajolet Ph., Odlyzko A.M.: Random mapping statistics. In: Advances in Cryptology EUROCRYPT 89. Lectore Notes in Computer Science, vol. 434, pp. 329–354 (1990).

7. Gassert T.A.: Chebyshev action on finite fields. Discret. Math. 315–316, 83–94 (2014).

   Article  MathSciNet  MATH  Google Scholar 

8. Hongzhou N., Yun L., Dequan H.: Public key encryption algorithm based on Chebyshev polynomials over finite fields. In: Proceedings of the 8th International Conference on Signal Processing (2006).

9. Kordov K.: Modified Chebyshev map based pseudo-random bit generator. In: AIP Conference Proceedings, 1629, AIP, pp. 432–436 (2014).

10. Lehmer D.H.: An extended theory of Lucas functions. Ann. Math. 31(3), 419–448 (1930).

    Article  MathSciNet  MATH  Google Scholar 

11. Lidl R., Mullen G.L., Turnwald G.: Dickson Polynomials, vol. 65. Chapman & Hall/CRC, Boca Raton (1993).

    MATH  Google Scholar 

12. Lucas E.: Théorie des fonctions numériques simplement périodiques. Am. J. Math. 1(4), 289–321 (1878).

    Article  Google Scholar 

13. Mullen G., Panario D.: Handbook of Finite Fields. Discrete Mathematics and Its Applications. Chapman and Hall/CRC, Boca Raton (2013).

    Book  MATH  Google Scholar 

14. Pollard J.M.: A Monte Carlo method for factorization. BIT 15(3), 331–334 (1975).

    Article  MathSciNet  MATH  Google Scholar 

15. Pollard J.M.: Monte Carlo methods for index computation (mod \(p\)). Math. Comput. 32(143), 918–924 (1978).

    MathSciNet  MATH  Google Scholar 

16. Qureshi C., Panario D.: Rédei actions on finite fields and multiplication map in cyclic groups. SIAM J. Discret. Math. 29, 1486–1503 (2015).

    Article  MATH  Google Scholar 

17. Qureshi C., Panario D., Martins R.: Cycle structure of iterating Rédei functions. Adv. Math. Commun. 11(2), 397–407 (2017).

    Article  MathSciNet  MATH  Google Scholar 

18. Stoyanov B.: Pseudo-random bit generator based on Chebyshev map. In: AIP Conference Proceedings, 1561, AIP, pp. 369–372 (2013).

19. Stoyanov B.: Pseudo-random bit generation algorithm based on Chebyshev polynomial and Tinkerbell map. Appl. Math. Sci. 8, 6205–6210 (2014).

    Google Scholar 

20. Ugolini S.: On the iterations of certain maps \(X\mapsto K\cdot (X+X^{-1})\) over finite fields of odd characteristic. J. Number Theory 142, 274–297 (2014).

    Article  MathSciNet  MATH  Google Scholar 

21. Vasiga T., Shallit J.: On the iteration of certain quadratic maps over \(GF(p)\). Discret. Math. 277, 219–240 (2004).

    Article  MathSciNet  MATH  Google Scholar 

Download references