arXiv · 0908.3920
Short Cycles in Repeated Exponentiation Modulo a Prime
Abstract
Given a prime $p$, we consider the dynamical system generated by repeated exponentiations modulo $p$, that is, by the map $u \mapsto f_g(u)$, where $f_g(u) \equiv g^u \pmod p$ and $0 \le f_g(u) \le p-1$. This map is in particular used in a number of constructions of cryptographically secure pseudorandom generators. We obtain nontrivial upper bounds on the number of fixed points and short cycles in the above dynamical system.
Explore related subjects
Keep this discovery
Lev Glebsky, Igor E. Shparlinski. 2009-08-27. Short Cycles in Repeated Exponentiation Modulo a Prime. https://arxiv.org/abs/0908.3920
Cite the original work for its findings. Save a collection to share your selection of sources.