On the cycle structure of repeated exponentiation modulo a prime

@article{Chou2004OnTC,
  title={On the cycle structure of repeated exponentiation modulo a prime},
  author={Wun-Seng Chou and Igor E. Shparlinski},
  journal={Journal of Number Theory},
  year={2004},
  volume={107},
  pages={345-356}
}
Abstract In a recent work, Shallit and Vasiga have obtained several results about tails and cycles in orbits of repeated squaring. Some of these results have been based on the Extended Riemann Hypothesis. Here, we extend their result to repeated exponentiation with any fixed exponent e and also show that in fact classical unconditional results about the distribution of primes in arithmetic progressions, combined with very elementary arguments, are quite sufficient to generalise and give an… Expand
On the Cycle Structure of Repeated Exponentiation Modulo a Prime Power
We obtain some results about the repeated exponentiation modulo a prime power from the viewpoint of arithmetic dynamical systems. Especially, we extend two asymptotic formulas about periodic pointsExpand
Cycle structure of iterating Redei functions
TLDR
It is shown, using the quadratic reciprocity law, that it is possible to extend the results of Vasiga and Shallit's study of tails and cycles in orbits of iterations of quadratics polynomials over prime fields to Redei functions overprime fields. Expand
Periodic points and tail lengths of split polynomial maps modulo primes
Explicit formulas are obtained for the number of periodic points and maximum tail length of split polynomial maps over finite fields for affine and projective space. This work includes a detailedExpand
#A58 INTEGERS 19 (2019) POWER MAPS IN FINITE GROUPS
In recent work, Pomerance and Shparlinski have obtained results on the number of cycles in the functional graph of the map x !→ xa in Fp. We prove similar results for other families of finite groups.Expand
J ul 2 01 9 Power maps in finite groups
In recent work, Pomerance and Shparlinski have obtained results on the number of cycles in the functional graph of the map x ↦ x in F∗ p . We prove similar results for other families of finiteExpand
Iterations of Integer Polynomial Maps Modulo Primes
In this elementary note we discuss some questions related to the behavior of iterations of polynomial maps with integer coefficients moduloprimes. In particular, we introduce three examples of suchExpand
Prime Decomposition in Iterated Towers and Discriminant Formulae
PRIME DECOMPOSITION IN ITERATED TOWERS AND DISCRIMINANT FORMULAE MAY 2014 T. ALDEN GASSERT, B.S. BOWDOIN COLLEGE M.S., UNIVERSITY OF MASSACHUSETTS AMHERST Ph.D., UNIVERSITY OF MASSACHUSETTS AMHERSTExpand
The Carlitz rank of permutations of finite fields: A survey
TLDR
A survey of results obtained so far on natural questions related to the Carlitz rank of f and a variety of applications, which emerged recently, are given. Expand
Monomial Dynamical Systems of Dimension One over Finite Fields
In this paper we study the monomial dynamical systems of dimension one over finite fields from the viewpoints of arithmetic and graph theory. We give formulas for the number of periodic points withExpand
Power Maps in Finite Groups
TLDR
Estimates for the number of cycles for cyclic groups, symmetric groups, dihedral groups andSL_2(\mathbb{F}_q) are obtained and it is shown that the cyclic group of order $n$ minimizes theNumber of cycles among all nilpotent groups of order £n for a fixed exponent. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 14 REFERENCES
On the Linear Complexity of the Power Generator
We obtain a lower bound on the linear complexity of the powergenerator of pseudo-random numbers, which in some special cases is alsoknown as the RSA generator and as the Blum–Blum–Shubgenerator. InExpand
Multiplicative Number Theory
From the contents: Primes in Arithmetic Progression.- Gauss' Sum.- Cyclotomy.- Primes in Arithmetic Progression: The General Modulus.- Primitive Characters.- Dirichlet's Class Number Formula.- TheExpand
On the iteration of certain quadratic maps over GF(p)
We consider the properties of certain graphs based on iteration of the quadratic maps x->x^2 and x->x^2-2 over a finite field GF(p).
On the distribution of the power generator
TLDR
The uniform distribution of the RSA generator and the Blum-Blum-Shub generator is proved, provided that the period t > m 3/4+δ with fixed δ > 0 and, under the same condition, the uniform distributed of a positive proportion of the leftmost and rightmost bits. Expand
Character sums with exponential functions
Let be an integer of multiplicative order t ≥ 1 modulo a prime p. Sums of the form S * (p,t,a)= exp (2πia zs /p) are introduced and estimated, with F=(z 1 ,...,z T ) a sequence such that kz 1 ,...,Expand
Period of the power generator and small values of Carmichael's function
TLDR
The principal tool is an estimate related to the Carmichael function λ(m), the size of the largest cyclic subgroup of the multiplicative group of residues modulo m, which shows that for any Δ ≥ (log log N) 3 , the authors have λ (m) ≥ N exp(-Δ) for all integers m with l ≤ m ≤ N, apart from at most N exp (-0.69(Δ log Δ) 1/3 ) exceptions. Expand
Small Values of the Carmichael Function and Cryptographic Applications
TLDR
It is shown rigorously that almost all randomly selected RSA moduli are safe against the so-called cycling attack and some arguments in support of the reliability of the timed-release crypto scheme, which has recently been proposed by R. Rivest, A. Shamir and D. Wagner. Expand
On the linear complexity profile of the power generator
TLDR
A lower bound on the linear complexity profile of the power generator of pseudo-random numbers modulo a Blum integer is obtained, implying that lattice reduction attacks on such generators are not feasible. Expand
On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
We obtain lower bounds on the linear and nonlinear complexity profile of a general nonlinear pseudorandom number generator, of the inversive generator, and of a new nonlinear generator calledExpand
A Simple Unpredictable Pseudo-Random Number Generator
TLDR
Two closely-related pseudo-random sequence generators are presented: the ${1 / P} generator, with input P a prime, and the $x^2 \bmod N$generator, which outputs the quotient digits obtained on dividing 1 by P. Expand
...
1
2
...