Jim Gillogly (jim@acm.org)
Tue, 02 Feb 1999 16:47:51 -0800
Enzo Michelangeli writes:
> If I remember well from my schooldays, however, a properly designed LCPRNG
> has _provably_ good statistical characteristics: e.g., provably uniform
> first-order distribution, provable stationariety, provably white spectrum
> (within the range of its period) etc.
However, plotting one in 2 dimensions can give lovely regular-looking
lines. This was one of the motivations that sent a bunch of us scurrying
off to GFSR-type algorithms. However, I agree that a CSPRNG would be
dominate either LC or GFSR if it's equally fast: anything bad for Monte
Carlo is worse for crypto.
-- Jim Gillogly 13 Solmath S.R. 1999, 00:41 12.19.5.16.8, 2 Lamat 1 Pax, Fourth Lord of Night
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:18:25