[4404] in cryptography@c2.net mail archive
Re: rng
daemon@ATHENA.MIT.EDU (staym@accessdata.com)
Tue Mar 30 12:00:57 1999
From: staym@accessdata.com
Date: Tue, 30 Mar 1999 09:37:46 -0700
To: cryptography@c2.net
Arnold G. Reinhold wrote:
>
> 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
Ah! Sorry, I meant truncated LCG.
--
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:staym@accessdata.com
