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.
- 1 ARVILLIAS, A. C., AND MARITSAS, D.G. Partitioning the period of a class of m-sequences and application to pseudorandom number generation. J. ACM 25, 4 (Oct. 1978), 675-686. Google Scholar
Digital Library
- 2 BECKMAN, R. J., AND JOHNSON, M. E. A ranking procedure for partial discriminant analysis. J. Am. Stat. Assoc. 76 (1981), 671-675.Google Scholar
Cross Ref
- 3 BRIGHT, H. S., AND ENISON, R. L. Quasi-random number sequences for a long-period TLP generator with remarks on application to cryptography. ACM Comput. Surv. I1, 4 (Dec. 1979), 357-370. Google Scholar
Digital Library
- 4 I'~EMBREE, G. B. Random number generation on micro-computers. Tech. Rep. Montana State Univ. Statistical Center, Bozeman, Montana.Google Scholar
- 5 LATAWIEC, K.J. New method of generation of shifted linear pseudorandom binary sequences. Proc. IEE 121'(1974), 905-906.Google Scholar
- 6 LEWIS, T. G., AND PAYNE, W. H. Generalized feedback shift register pseudorandom number algorithm. J. ACM 20, 3 (July 1973), 456-468. Google Scholar
Digital Library
- 7 MARITSAS, D. G., ARVILLIAS, A. C., AND BOUNAS, A.C. Phase-shift analysis of linear feedback shift register structures generating pseudorandom sequences. IEEE Trans. Comput. C-27, (1978), 660-669.Google Scholar
Digital Library
- 8 MARSAGLIA, G. Random numbers fall mainly in the planes. Proc. Nat. Acad. Sci. 61 (1968), 25-28.Google Scholar
Cross Ref
- 9 PAYNE, W. H., AND MCMILLEN, K. L. Orderly enumeration of nonsingular binary matrices applied to text encryption. Commun. ACM 21, 4 (Apr. 1978), 259-263. Google Scholar
Digital Library
- 10 SIMMONS, G.J. Symmetric and asymmetric encryption. ACM Comput. Surv. 11, 4 (Dec. 1979) 305-330. Google Scholar
Digital Library
- 11 TAUSWORTHE, R. C. Random numbers generated by linear recurrence modulo two. Math. Comput. 19 (1965), 201-209.Google Scholar
Cross Ref
- 12 TOOTILL, J. P. R., ROaiNSON, W. D., AND ADAMS, A.G. The runs up-and-down performance of Tausworthe pseudo-random number generators. J. ACM 18, 3 (July 1971), 381-399. Google Scholar
Digital Library
- 13 TOOTILL, J. P. R., ROBINSON, W. D., AND EAGLE, O.J. An asymptotically random Tausworthe sequence. J. ACM 20, 3 (July 1973), 469-481. Google Scholar
Digital Library
- 14 WEISS, M.S. Modifications of the Kolmogorov-Smirnov statistic for use with correlated data. J. Am. Stat. Assoc. 73 (1978), 872-875.Google Scholar
Cross Ref
- 15 WHITTLESEY, J. R.B. On the multidimensional uniformity of pseudorandom number generators. Commun. ACM 12, 5 (May 1969), 247. Google Scholar
Digital Library
- 16 ZIERLER, N. Linear recurring sequences. J. SIAM 7 (1959), 31-48.Google Scholar
- 17 ZIERLER, N., AND BRILLHART, J. On primitive trinomials (rood 2). Inf. Control 13 (1968), 541-554.Google Scholar
Cross Ref
- 18 ZIERLER, N., AND BRILLHART, J. On primitive trinomials (mod 2), If. Inf. Control 14 (1969), 566-569.Google Scholar
Cross Ref
Index Terms
Initializing generalized feedback shift register pseudorandom number generators
Recommendations
Generalized Feedback Shift Register Pseudorandom Number Algorithm
The generalized feedback shift register pseudorandom number algorithm has several advantages over all other pseudorandom number generators. These advantages are: (1) it produces multidimensional pseudorandom numbers; (2) it has an arbitrarily long ...
A Statistical Analysis of Generalized Feedback Shift Register Pseudorandom Number Generators
We analyze the statistical performance of uniform pseudorandom numbers generated by the generalized feedback shift register (GFSR) algorithm of Lewis and Payne. Tests for equidistribution and for statistical independence of successive pseudorandom ...
Splittable pseudorandom number generators using cryptographic hashing
Haskell '13We propose a new splittable pseudorandom number generator (PRNG) based on a cryptographic hash function. Splittable PRNGs, in contrast to linear PRNGs, allow the creation of two (seemingly) independent generators from a given random number generator. ...








Comments