Twisted GFSR generators

@article{Matsumoto1992TwistedGG,
  title={Twisted GFSR generators},
  author={M. Matsumoto and Y. Kurita},
  journal={ACM Trans. Model. Comput. Simul.},
  year={1992},
  volume={2},
  pages={179-194}
}
  • M. Matsumoto, Y. Kurita
  • Published 1992
  • Computer Science
  • 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 Abstract
    177 Citations
    Mersenne Twister – A Pseudo Random Number Generator and its Variants
    • 14
    Twisted GFSR generators II
    • 182
    • PDF
    Primitives Based on Jumping LFSRswithDetermined Period
    • Highly Influenced
    • PDF
    Maximally equidistributed pseudorandom number generators via linear output transformations
    • Shin Harase
    • Mathematics, Computer Science
    • Math. Comput. Simul.
    • 2009
    • 7
    A UNIFIED VIEW OF LONG-PERIOD RANDOM NUMBER GENERATORS
    • 10
    • PDF
    Pseudorandom Number Generation: Impossibility and Compromise
    • 31
    • PDF
    Revisiting LFSMs
    • PDF

    References

    SHOWING 1-4 OF 4 REFERENCES
    Algebraic coding theory
    • E. Berlekamp
    • Computer Science
    • McGraw-Hill series in systems science
    • 1968
    • 2,723
    • Highly Influential
    An Asymptotically Random Tausworthe Sequence
    • 82
    • Highly Influential
    Definitions of randomness
    • 31
    • Highly Influential
    A current view of random numbers. in Computer Science and Statistics: The Interface. L
    • Billard (ed.) Elsevier,
    • 1985