🚀 go-pugleaf

In article <1992Oct1.190441.15712@netcom.com> rcain@netcom.com (Robert Cain) writes:
>I believe the problem with using a known irrational number and a secret
>starting place as a key is that keys must be large to stop brute force
>and I don't think there is a way to just start generating digits from
>an arbitrary point without generating all the ones in between.  So while
>it would work, it would be computationally infeasable.  Someone please
>correct me if I am wrong.  I have wondered about this also.
>
>Bob Cain    rcain@netcom.com   408-358-2007

	This perhaps bring up the similar concept of cryptographically
secure pseudo-random number generators.  I remember reading one
scheme [Vazirani? or Blum?] which uses the equation
x[i+1] = x[i-1] ^ (x[i] * x[i]) mod N
where ^ is the xor operator, an indispensable operation.  Only a
fraction of the bits are secure ... on the order of Sqrt[ Log[2., N] ],
though this may be off by a constant.  You may produce a potentially
infinite series of secure bits ... and other useful properties.
	Anyone have better references?

-- Myron