1. Twq pseudo-random sequence generators.

In this paper, two pseudo-random

sequence generators are defined and their properties discussed. These are called:
(1) the 1 /P generufor,
(2) the x* mod N generator.
The two generators are closely related. For example: Rom short seeds, each quickfy
generates long well-distributed sequences. Bath generators contain hard problems ut their
tore (the discrete logarithm problem and the quadratic residuacity problem, respectively). But only the
second is unpredictable -assuming a certain iruractibility
hypothesis.
More specifically, THEOREM 2, Problem 4 (4 6). Any sequence produced by the
l/P generator is completely predictable; that is, given a small segment of the sequence,
one cun quickly infer the seed and eficiently extend the given segment backwards
and forwards.