Untwisting the Mersenne Twister: How I Killed the PRNG Moloch

Explore the intricacies of pseudorandom number generation in this 43-minute conference talk from BSidesLV 2014. Delve into the history of early pseudorandom generators, including the Middle Squares Method, and understand the crucial differences between random and pseudorandom numbers. Examine the importance of PRNG period size and learn about the Die Hard randomness tests. Investigate Sony's ECC Random and the challenges of brute-force algorithms. Analyze the problem of depth in state inference and explore the glibc rando implementation. Gain insights into the Python GIL and its impact on random number generation. Discover the potential of distributed computing in addressing PRNG challenges. By the end of this talk, gain a comprehensive understanding of the complexities surrounding pseudorandom number generation and its implications for security.

Intro
WHOAMI
Nature
Early Pseudorandom Generators
Middle Squares Method
Random vs. Pseudorandom
PRNG Period Size
The Die Hard Tests
Die Hard Randomness Tests
Sony's ECC Random
Bruteforce
Algorithm
Problem of Depth
State Inference
glibc rando
The Python GIL
Code Sample
Distributed Computing
Contact Us