• Corpus ID: 198938547

Pseudo Random Number Generator for Erlang

  title={Pseudo Random Number Generator for Erlang},
  author={K. Rikitake},
The stock implementation of Erlang/OTP pseudo random number generator (PRNG), random module, is based on an algorithm developed in 1980s called AS183, and has known statistic deficiencies for large-scale applications. Using modern PRNG algorithms with longer generation periods reduces the deficiencies. This paper is a case study of sfmt-erlang module, an implementation of SIMD-oriented Fast Mersenne Twister (SFMT) PRNG with the native interface functions (NIFs) of Erlang. The test results show… 
1 Citations

Figures and Tables from this paper

Privacy preserving DBSCAN clustering algorithm for vertically partitioned data in distributed systems
  • I. Anikin, Rinat M. Gazimov
  • Computer Science
    2017 International Siberian Conference on Control and Communications (SIBCON)
  • 2017
The modification of DBSCAN clustering algorithm for vertically partitioned big data provides privacy of the information which is transmitted via telecommunication channels between nodes of big data storage and provides data confidentiality at all steps ofDBSCAN algorithm.


Dynamic creation of pseudorandom number generators
A new scheme Dynamic Creation of pseudorandom number generators (PRNG) for large scale Monte Carlo simulations in parallel or distributed systems that creates a PRNG satisfying the specification, so that ID number is encoded in the characteristic polynomial of PRNG.
SIMD-Oriented Fast Mersenne Twister: a 128-bit Pseudorandom Number Generator
A 128-bit based PRNG, named SIMD-oriented Fast Mersenne Twister (SFMT), which is analogous to MT but making full use of these features, and is roughly twice as fast as optimised MT using SIMD operations.
Correction: Algorithm AS 183: An Efficient and Portable Pseudo-Random Number Generator
The algorithm is claimed to be reasonably short, reasonably fast, machine-independent, easily programmed in any language, and statistically sound.
Common defects in initialization of pseudorandom number generators
We demonstrate that a majority of modern random number generators, such as the newest version of rand.c, ranlux, and combined multiple recursive generators, have some manifest correlations in their
Generating good pseudo-random numbers
In producing a revised generator, extensive use has been made of a test package TestU01 for random number generators, using this, criteria have been devised for the revised generator and other high-quality generators have been identified.
Algorithm AS 183: An Efficient and Portable Pseudo-Random Number Generator
  • Journal of the Royal Statistical Society. Series C (Applied Statistics),
  • 1982
Erlang/OTP and how the PRNGs work
  • In Erlang Factory SF Bay
  • 2011
Erlang Programming Language and The Open Telecom Platform ( Erlang / OTP ) Temporary user tracking in major browsers and Cross - domain information leakage and attacks , Nov
  • 2008
Temporary user tracking in major browsers and Cross-domain information leakage and attacks, Nov
  • 2008
Mersenne Twister in Erlang. in mailing list erlangquestions@erlang.org
  • June 6,
  • 2007