Institution: | Department of Mathematics, University of Toronto, Toronto, Ontario M5S 3G3, Canada ; Department of Fundamental Mathematics, Bell Labs, Murray Hill, New Jersey 07974-0636 ; Department of Computing, Macquarie University, Sydney, New South Wales 2109, Australia |
Abstract: | Consider the pseudorandom number generator where we are given the modulus , the initial value and the exponent . One case of particular interest is when the modulus is of the form , where are different primes of the same magnitude. It is known from work of the first and third authors that for moduli , if the period of the sequence exceeds , then the sequence is uniformly distributed. We show rigorously that for almost all choices of it is the case that for almost all choices of , the period of the power generator exceeds . And so, in this case, the power generator is uniformly distributed. We also give some other cryptographic applications, namely, to ruling-out the cycling attack on the RSA cryptosystem and to so-called time-release crypto. The principal tool is an estimate related to the Carmichael function , the size of the largest cyclic subgroup of the multiplicative group of residues modulo . In particular, we show that for any , we have for all integers with , apart from at most exceptions. |