[4405] in cryptography@c2.net mail archive
Re: rng
daemon@ATHENA.MIT.EDU (Arnold G. Reinhold)
Tue Mar 30 12:51:50 1999
In-Reply-To: <37002E67.510@accessdata.com>
Date: Tue, 30 Mar 1999 11:24:33 -0500
To: staym@accessdata.com, cryptography@c2.net
From: "Arnold G. Reinhold" <reinhold@world.std.com>
At 6:52 PM -0700 3/29/99, staym@accessdata.com wrote:
>Is it possible to choose a seed, multiplier, and modulus for a linear
>congruential generator such that it duplicates any finite list of
>positive integers?
>
>[No, but I'll let others expand or do it in another message. --Perry]
>
>--
>Mike Stay
You can see that Perry is right by a simple counting argument. Say the word
size is m bits. There are 2**(3*m) cvombinations of seed, multiplier, and
modulus and there are (2**m)! possible arangements of the values. The
latter is much bigger for m > 2.
Arnold Reinhold
