Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Scrambled Linear Pseudorandom Number Generators

Scrambled Linear Pseudorandom Number Generators F2-linear pseudorandom number generators are very popular due to their high speed, to the ease with which generators with a sizable state space can be created, and to their provable theoretical properties. However, they suffer from linear artifacts that show as failures in linearity-related statistical tests such as the binary-rank and the linear-complexity test. In this article, we give two new contributions. First, we introduce two new F2-linear transformations that have been handcrafted to have good statistical properties and at the same time to be programmable very efficiently on superscalar processors, or even directly in hardware. Then, we describe some scramblers, that is, nonlinear functions applied to the state array that reduce or delete the linear artifacts, and propose combinations of linear transformations and scramblers that give extremely fast pseudorandom number generators of high quality. A novelty in our approach is that we use ideas from the theory of filtered linear-feedback shift registers to prove some properties of our scramblers, rather than relying purely on heuristics. In the end, we provide simple, extremely fast generators that use a few hundred bits of memory, have provable properties, and pass strong statistical tests. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Mathematical Software (TOMS) Association for Computing Machinery

Scrambled Linear Pseudorandom Number Generators

Download PDF
32 pages

Loading next page...
 
/lp/association-for-computing-machinery/scrambled-linear-pseudorandom-number-generators-40X2TH7eRS

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2021 Copyright held by the owner/author(s). Publication rights licensed to ACM.
ISSN
0098-3500
eISSN
1557-7295
DOI
10.1145/3460772
Publisher site
See Article on Publisher Site

Abstract

F2-linear pseudorandom number generators are very popular due to their high speed, to the ease with which generators with a sizable state space can be created, and to their provable theoretical properties. However, they suffer from linear artifacts that show as failures in linearity-related statistical tests such as the binary-rank and the linear-complexity test. In this article, we give two new contributions. First, we introduce two new F2-linear transformations that have been handcrafted to have good statistical properties and at the same time to be programmable very efficiently on superscalar processors, or even directly in hardware. Then, we describe some scramblers, that is, nonlinear functions applied to the state array that reduce or delete the linear artifacts, and propose combinations of linear transformations and scramblers that give extremely fast pseudorandom number generators of high quality. A novelty in our approach is that we use ideas from the theory of filtered linear-feedback shift registers to prove some properties of our scramblers, rather than relying purely on heuristics. In the end, we provide simple, extremely fast generators that use a few hundred bits of memory, have provable properties, and pass strong statistical tests.

Journal

ACM Transactions on Mathematical Software (TOMS) – Association for Computing Machinery

Published: Sep 28, 2021

Keywords: Pseudorandom number generators

References

  • A new test for Hamming-weight dependencies
    Blackman, David; Vigna, Sebastiano
  • Fly, you fool! Faster Frodo for the ARM Cortex-M4
    Bos, Joppe W.; Friedberger, Simon; Martinoli, Marco; Oswald, Elisabeth; Stam, Martijn
  • Algebra: Elements of Mathematics
    Bourbaki, Nicolas
  • The ANF of the composition of addition and multiplication mod with a Boolean function
    Braeken, An; Semaev, Igor A.
  • Noncommutative determinants, Cauchy–Binet formulae, and Capelli-type identities I
    Caracciolo, Sergio; Sokal, Alan D.; Sportiello, Andrea
  • Aspects of Local Linear Complexity
    Carter, G. D.
  • Algebraic properties of Manin matrices 1
    Chervov, A.; Falqui, G.; Rubtsov, V.
  • The hierarchy of correlations in random binary sequences
    Compagner, Aaldert
  • Empirical tests of binary keystreams
    Erdmann, E. D.
  • An Efficient and Provable Masked Implementation of qTESLA
    Grd, Frans; Rossi, Mssa
  • Efficient jump ahead for -linear random number generators
    Haramoto, Hiroshi; Matsumoto, Makoto; Nishimura, Takuji; Panneton, François; L’Ecuyer, Pierre
  • The On-Line Encyclopedia of Integer Sequences
    Inc, OEIS Foundation
  • Stream Ciphers
    Klein, Andreas
  • Two notes on notation
    Knuth, Donald E.
  • The Art of Computer Programming, Volume 1, Fundamental Algorithms (3rd ed
    Knuth, Donald E.
  • Improved bounds on the linear complexity of keystreams obtained by filter generators
    Kolokotronis, Nicholas; Limniotis, Konstantinos; Kalouptsidis, Nicholas
  • Maximally equidistributed combined tausworthe generators
    L’Ecuyer, Pierre
  • Combined generators with components from different families
    L’Ecuyer, Pierre; Granger-Piché, Jacinthe
  • Fast random number generators based on linear recurrences modulo 2: overview and comparison
    L’Ecuyer, Pierre; Panneton, François
  • -linear random number generators
    L’Ecuyer, Pierre; Panneton, François
  • TestU01: A C library for empirical testing of random number generators
    L’Ecuyer, Pierre; Simard, Richard
  • Fermat: A Computer Algebra System for Polynomial and Matrix Computation
    Lewis, Robert H.
  • Introduction to Finite Fields and their Applications
    Lidl, Rudolf; Niederreiter, Harald
  • Xorshift RNGs
    Marsaglia, George
  • Matrices and the structure of random number sequences
    Marsaglia, George; Tsay, Liang-Huei
  • Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator
    Matsumoto, Makoto; Nishimura, Takuji
  • Common defects in initialization of pseudorandom number generators
    Matsumoto, Makoto; Wada, Isaku; Kuramoto, Ai; Ashihara, Hyo
  • An extension of the birthday problem
    Naus, Joseph I.
  • The multiple-recursive matrix method for pseudorandom number generation
    Niederreiter, Harald
  • Tablesof 64-bit mersenne twisters
    Nishimura, Takuji
  • Improved long-period generators based on linear recurrences modulo 2
    Panneton, François; L’Ecuyer, Pierre; Matsumoto, Makoto
  • A PRNG specialized in double precision floating point numbers using an affine transition
    Saito, Mutsuo; Matsumoto, Makoto
  • XSadd (Version 1
    Saito, Mutsuo; Matsumoto, Makoto
  • Tiny Mersenne Twister (Version 1
    Saito, Mutsuo; Matsumoto, Makoto
  • Determinants of block matrices with noncommuting blocks
    Sothanaphan, Nat
  • Fast splittable pseudorandom number generators
    Steele, Guy L.; Jr,
  • Collecting performance data with papi-c
    Terpstra, Dan; Jagode, Heike; You, Haihang; Dongarra, Jack
  • SageMath, the Sage Mathematics Software System (Version 8
    Developers, The Sage
  • An experimental exploration of Marsaglia’s xorshift generators, scrambled
    Vigna, Sebastiano
  • Further scramblings of Marsaglia’s xorshift generators
    Vigna, Sebastiano
  • It is high time we let go of the Mersenne Twister
    Vigna, Sebastiano
  • On the probability of overlap of random subsequences of pseudorandom number generators
    Vigna, Sebastiano