[OT] Algorithm question

Ola Fosheim Grøstad via Digitalmars-d digitalmars-d at puremagic.com
Mon May 1 05:33:10 PDT 2017


On Monday, 1 May 2017 at 11:57:32 UTC, Ola Fosheim Grøstad wrote:
> Ah, found a sensible search term: «pseudorandom permutation»
>
> http://cse.iitkgp.ac.in/~debdeep/courses_iitkgp/FCrypto/slides/LubyRackoff.pdf
>
> If you go down this path, please share links. Useful stuff 
> actually.

A readable paper for most people:
http://www.pcg-random.org/pdf/toms-oneill-pcg-family-v1.02.pdf

«some users would prefer a much stronger property analogous to
uniformity: that over the full period of the generator, every 
possible k-tuple will occur,
and it will occur the same number of times.»

PCG claims to have arbitrary cycle sizes.

I haven't looked at it, but it is available as C/C++.



More information about the Digitalmars-d mailing list