Initializing generalized feedback shift register pseudorandom number generators

Authors:
Bruce Jay Collings;G. Barry Hembree
Affiliations:
Montana State Univ., Bozeman;BDM Corp., Albuquerque, NM
Venue:
Journal of the ACM (JACM)
Year:
1986

Citing 8
Cited 3

The Runs Up-and-Down Performance of Tausworthe Pseudo-Random Number Generators

Journal of the ACM (JACM)
Generalized Feedback Shift Register Pseudorandom Number Algorithm

Journal of the ACM (JACM)
An Asymptotically Random Tausworthe Sequence

Journal of the ACM (JACM)
Partitioning the Period of a Class of m-Sequences and Application to Pseudorandom Number Generation

Journal of the ACM (JACM)
Symmetric and Asymmetric Encryption

ACM Computing Surveys (CSUR)
Quasi-Random Number Sequences from a Long-Period TLP Generator with Remarks on Application to Cryptography

ACM Computing Surveys (CSUR)
Orderly enumeration of nonsingular binary matrices applied to text encryption

Communications of the ACM
Letters to the editor: on the multidimensional uniformity of pseudorandom generators

Communications of the ACM

Random numbers for simulation

Communications of the ACM - Special issue on simulation
GFSR pseudorandom number generation using APL

Proceedings of the conference on APL '99 : On track to the 21st century: On track to the 21st century
A very long period (VLP) pseudorandom number generator for the microcomputer environment

CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The generalized feedback shift register pseudorandom number generators proposed by Lewis and Payne provide a very attractive method of random number generation. Unfortunately, the published initialization procedure can be extremely time consuming. This paper considers an alternative method of initialization based on a natural polynomial representation for the terms of a feedback shift register sequence that results in substantial improvements in the initialization process.