Short Cycles in Repeated Exponentiation Modulo a Prime

Details Short Cycles in Repeated Exponentiation Modulo a Prime Short Cycles in Repeated Exponentiation Modulo a Prime

2009-08-27

arxiv.org/abs/0908.3920v1

Mathematics

Number Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Short Cycles in Repeated Exponentiation Modulo a Prime does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Short Cycles in Repeated Exponentiation Modulo a Prime, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Short Cycles in Repeated Exponentiation Modulo a Prime will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-410947