[Cryptography] A better random number generator...

[Henry Baker]

At 04:47 PM 2/18/2015, Tom Mitchell wrote:
>A talk at Stanford:
>The video will be online later...
>
>Talk by:
>Melissa O'Neill
>Harvey Mudd College
>
>Algorithmic random number generators are everywhere, used for all kinds of tasks, from simulation to computational creativity.
>
>Yet most people haven't given much thought to the random number generators they use.  Is the RNG you're using a good source of randomness? What does it even mean to be a good RNG?
>
>In this talk, we will examine the desirable properties of a random number generator including performance, correctness, uniformity, and unpredictability, as well as sound mathematical grounding.
>
>We will observe how the RNGs in widespread use lack desirable properties (most commonly failing statistical tests for randomness).
>
>Then we will show how a simple twist on a venerable-but-flawed RNG technique can provide all the properties we desire, resulting in the PCG family of RNGs.
>
>http://web.stanford.edu/class/ee380/Abstracts/150218.html
>
>--
>T o m  M i t c h e l l

Come on, people!  Only 68 views so far.

This video should be _required watching_ before anyone is allowed to even use "random number" in a sentence, much less in computer code.
------
Published on Feb 19, 2015

"PCG: A Family of Better Random Number Generators" - Melissa O'Neill of Harvey Mudd College

Colloquium on Computer Systems Seminar Series (EE380) presents the current research in design, implementation, analysis, and use of computer systems.  Topics range from integrated circuits to operating systems and programming languages.  It is free and open to the public, with new lectures each week.

https://www.youtube.com/watch?v=45Oet5qjlms