This talk at Stanford quickly covers a lot of ground on this topic. Stanford Seminar - Melissa O'Neill of Harvey Mudd College
http://youtu.be/45Oet5qjlms See also http://web.stanford.edu/class/ee380/ and follow the information for the talk. http://ee380.stanford.edu/Abstracts/150218.html On Tue, Mar 10, 2015 at 9:35 PM, <[email protected]> wrote: > http://www.pcg-random.org/ > > PCG is a family of simple fast space-efficient statistically > good algorithms for random number generation. Unlike many > general-purpose RNGs, they are also hard to predict. > -- > http://www.subspacefield.org/~travis/ > "Computer crime, the glamor crime of the 1970s, will become in the > 1980s one of the greatest sources of preventable business loss." > John M. Carroll, "Computer Security", first edition cover flap, 1977 > > _______________________________________________ > RNG mailing list > [email protected] > https://lists.bitrot.info/mailman/listinfo/rng > > -- T o m M i t c h e l l
_______________________________________________ RNG mailing list [email protected] https://lists.bitrot.info/mailman/listinfo/rng
