Pseudo Random Number Generators (PRNGs) is a key component of providing randomness in Erlang. In this talk, Kenji will explain the current status of the PRNGs in Erlang/OTP, the security and performance implications, and how they could be improved by introducing new algorithms. Kenji will also describe the details of implementing the SIMD-oriented Fast Mersenne Twister (SMFT) PRNG as Erlang/OTP NIFs.
Target Audience: Programmers interested in the internals of Erlang/OTP libraries and the NIF programming, as well as users intending to use Erlang/OTP for simulation, modeling, and security applications.
Talk Objectives: Sharing the characteristics and pitfalls of handling random numbers with Erlang/OTP, and showing an example of implementing a better PRNG as NIFs.
Loading more stuff…
Hmm…it looks like things are taking a while to load. Try again?