A revision of the subtract-with-borrow random number generators

  title={A revision of the subtract-with-borrow random number generators},
  author={Alexei Sibidanov},
  • A. Sibidanov
  • Published 2017
  • Mathematics, Physics, Computer Science
  • ArXiv
Abstract The most popular and widely used subtract-with-borrow generator, also known as RANLUX, is reimplemented as a linear congruential generator using large integer arithmetic with the modulus size of 576 bits. Modern computers, as well as the specific structure of the modulus inferred from RANLUX, allow for the development of a fast modular multiplication — the core of the procedure. This was previously believed to be slow and have too high cost in terms of computing resources. Our tests… Expand
Review of High-Quality Random Number Generators
This paper outlines the Kolmogorov–Anosov theory of mixing in classical mechanical systems, and establishes criteria for deciding which RNG’s are sufficiently good approximations to the ideal mathematical systems that guarantee highest quality. Expand
Co-simulation of linear congruential generator by using Xilinx system generator and MATLAB Simulink
  • S. Suneeta
  • Computer Science
  • International Journal of Reconfigurable and Embedded Systems (IJRES)
  • 2021
An exhaustive search for the best arbitrary numeral generator in a full period linear congruential generator (LCG) with the largest prime numbers is conducted. Expand
A Portable Implementation of RANLUX++
High energy physics has a constant demand for random number generators (RNGs) with high statistical quality. In this paper, we present ROOT’s implementation of the RANLUX++ generator. We discuss theExpand
Superuniversality from disorder at two-dimensional topological phase transitions
We investigate the effects of quenched randomness on topological quantum phase transitions in strongly-interacting two-dimensional systems. We focus first on transitions driven by the condensation ofExpand


On the lattice structure of the add-with-carry and subtract-with-borrow random number generators
It is shown that these sequences are essentially equivalent to linear congruential sequences with very large prime moduli, and how the equivalence can be exploited to implement efficient jumping-ahead facilities for the AWC and SWB sequences. Expand
RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of Lüscher
A portable Fortran 77 implementation of a high-quality generator called RANLUX (for LUXury RANdom numbers), using the algorithm of Martin Luscher described in an accompanying article. Expand
TestU01: A C library for empirical testing of random number generators
We introduce TestU01, a software library implemented in the ANSI C language, and offering a collection of utilities for the empirical statistical testing of uniform random number generators (RNGs).Expand
A portable high-quality random number generator for lattice field theory simulations
Abstract The theory underlying a proposed random number generator for numerical simulations in elementary particle physics and statistical mechanics is discussed. The generator is based on anExpand
A New Class of Random Number Generators
Data Analysis Framework
The Art of Computer Programming, Volume 2 (3rd Ed.)
  • Seminumerical Algorithms,
  • 1997
The Art of Computer Programming, Volume II: Seminumerical Algorithms
  • D. Knuth
  • Mathematics, Computer Science
  • 1969
Testu 01 : A c library for empirical testing of random number generators ACM Trans
  • Math . Softw .