On the period of the linear congruential and power generators
P. Kurlberg, C. Pomerance
Abstract
We consider the periods of the linear congruential and the power generators modulo n and, for fixed choices of initial parameters, give lower bounds that hold for ``most'' n when n ranges over three different sets: the set of primes, the set of products of two primes (of similar size), and the set of all integers. For most n in these sets, the period is at least n1/2+ε(n) for any monotone function ε(n) tending to zero as n tends to infinity. Assuming the Generalized Riemann Hypothesis, for most n in these sets the period is greater than n1-ε for any ε>0. Moreover, the period is unconditionally greater than n1/2+δ, for some fixed δ>0, for a positive proportion of n in the above mentioned sets. These bounds are related to lower bounds on the multiplicative order of an integer e modulo p-1, modulo λ(pl), and modulo λ(m) where p,l range over the primes, m ranges over the integers, and where λ(n) is the order of the largest cyclic subgroup of (/n)×.
Create a lesson
Related papers
Unit fraction representations using shifted Golomb primes
Rishika Agrawal
Improved deterministic integer factorization by quadratic-image sieving
Pantelimon Stănică
Private key sieves for improved attacks on RSA
Markus Hittmeir
Multiple q-zeta values as polynomials in partition multiplicities
Jan-Willem M. van Ittersum
Hopf-Galois Structures on Extensions Arising from Division Points on Elliptic Curves
Leolin Nkuete
Certified Collision Exclusion and an Unconditional Upper Bound Λ<0.156821 for the de Bruijn--Newman Constant
Michel Planat, Dale James Raymond