Twisted GFSR generators

  title={Twisted GFSR generators},
  author={Makoto Matsumoto and Yoshiharu Kurita},
  journal={ACM Trans. Model. Comput. Simul.},
The generalized feed back shift register (GFSR) algorithm suggested by Lewis and Payne is a widely used pseudorandom number generator, but has the following serious drawbacks: (1) an initialization scheme to assure higher order equidistribution is involved and is time consuming; (2) each bit of the generated words constitutes an m-sequence based on a primitive trinomials, which shows poor randomness with respect to weight distribution; (3) a large working area is necessary; (4) the period of sequence is far shorter than the theoretical upper bound. [...] Key MethodExpand
Mersenne Twister – A Pseudo Random Number Generator and its Variants
Random number generators(RNG) are widely being used in number of applications, particularly simulation and cryptography. They are a critical part of many cryptographic systems such as key generation,
Twisted GFSR generators II
This follow up article introduces and analyzes a new TGFSR variant having better k-distribution property, and provides an efficient algorithm to obtain the order of equidistribution, together with a tight upper bound on the order.
Primitives Based on Jumping LFSRswithDetermined Period
Linear feedback shift registers (LFSRs) are used in many stream ciphers because of their maximal period and good statistical properties. Due to the linearity of the LFSR, its output cannot be
A Non-empirical Test on the Second to the Sixth Least Significant Bits of Pseudorandom Number Generators
Lagged Fibonacci generators are widely used random number generators. Some implementations discard the least significant bit of their outputs, because their weight distribution has a strong
Maximally equidistributed pseudorandom number generators via linear output transformations
  • S. Harase
  • Mathematics, Computer Science
    Math. Comput. Simul.
  • 2009
A new strategy to find linear output transformations attaining the Me property is introduced, and a modified version of the WELL generators with the ME property is found, having fewer operations than the original ME THE AUTHORS well generators.
Two types of linear congruent.ial random number generator are considered: the conventional one using integer arithmetic and another using polynomial arithmetic over finite fields. We show t.hat most
Pseudorandom Number Generation: Impossibility and Compromise
This manuscript gives a brief explanation on pseudorandom number generators for Monte Carlo simulation.
Software Oriented Stream Ciphers Based upon FCSRs in Diversified Mode
A new design for FCSRs suitable for software applications which is really efficient in software and resistant to the previous attacks and the internal diffusion is significantly improved.
Revisiting LFSMs
This paper gives first a general representation of LFSMs using traditional matrices representation linking this definition together with a new polynomial representation leading to sp arse representations and implementations and shows how this leads to a powerful design for LFSRs efficient in both hardware and software.
Mersenne Twister A Pseudo-Random Number Generator
Pseudo random number generators have been widely used in numbers of applications, particularly simulation and cryptography. Among them is a Mersenne Twister. Introduced in 1998 by Makoto Matsumoto


The k-distribution of generalized feedback shift register pseudorandom numbers
A necessary and sufficient condition is established for the generalized feedback shift register (GFSR) sequence introduced by Lewis and Payne to be k-distributed. Based upon the theorem, a
Generalized Feedback Shift Register Pseudorandom Number Algorithm
The generalized feedback shift register pseudorandom number algorithm has several advantages over all other pseudor random number generators, including an arbitrarily long period independent of the word size of the computer on which it is implemented and the “same” floating-point pseudOrandom number sequence is obtained on any machine.
Shift Register Sequences
The Revised Edition of Shift Register Sequences contains a comprehensive bibliography of some 400 entries which cover the literature concerning the theory and applications of shift register sequences.
Algebraic coding theory
  • E. Berlekamp
  • Computer Science
    McGraw-Hill series in systems science
  • 1968
This is the revised edition of Berlekamp's famous book, "Algebraic Coding Theory," originally published in 1968, wherein he introduced several algorithms which have subsequently dominated engineering
An Asymptotically Random Tausworthe Sequence
An asymptotically random 23-bit number sequence of astronomic period, 2607 - 1, is presented and possesses equidistribution and multidimensional uniformity properties vastly in excess of anything that has yet been shown for conventional congruentially generated sequences.
Primitive t-Nomials(t=3,5)over GF(2) Whose Degree is a Mersenne Exponent≦44497
All of the primitive trinomials over GF(2) with degree p given by one of the Mersenne exponents 19937, 21701, 23209, and 44497 are presented. Also, one example of a primitive pentanomial over GF(2)
On Primitive Trinomials (Mod 2)
Random numbers for simulation
This paper focuses mainly on efficient and recently proposed techniques for generating uniform pseudorandom numbers, and aims to design more robust generators without having to pay too much in terms of portability, flexibility, and efficiency.
Definitions of randomness
Randomness is a fundamental but elusive concept in mathematics and physics. Even for the elementary case of a random binary sequence, a generally accepted and operational definition is lacking.
The hierarchy of correlations in random binary sequences
The meaning of randomness is studied for the simple case of binary sequences. Ensemble theory is used, together with correlation coefficients of any order. Conservation laws for the total amount of