The k -distribution of generalized feedback shift register pseudorandom numbers
- 1 July 1983
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 26 (7), 516-523
- https://doi.org/10.1145/358150.358159
Abstract
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 theoretical test for k-distributivity is proposed and performed in a reasonable amount of computer time, even for k = 16 and a high degree of resolution (for which statistical tests are impossible because of the astronomical amount of computer time required). For the special class of GFSR generators considered by Arvillias and Maritsas based on the primitive trinomial D p + D q + 1 with q = an integral power of 2, it is shown that the sequence is k-distributed if and only if the lengths of all subregisters are at least k. The theorem also leads to a simple and efficient method of initializing the GFSR generator so that the sequence to be generated is k-distributed.Keywords
This publication has 10 references indexed in Scilit:
- Quasi-Random Number Sequences from a Long-Period TLP Generator with Remarks on Application to CryptographyACM Computing Surveys, 1979
- Toggle-Registers Generating in Parallel k kth Decimations of m-Sequences xP+ xk+ 1 Design TablesIEEE Transactions on Computers, 1979
- Partitioning the Period of a Class of m -Sequences and Application to Pseudorandom Number GenerationJournal of the ACM, 1978
- Orderly enumeration of nonsingular binary matrices applied to text encryptionCommunications of the ACM, 1978
- New method of generation of shifted linear pseudorandom binary sequencesProceedings of the Institution of Electrical Engineers, 1974
- Generalized Feedback Shift Register Pseudorandom Number AlgorithmJournal of the ACM, 1973
- An Asymptotically Random Tausworthe SequenceJournal of the ACM, 1973
- The Runs Up-and-Down Performance of Tausworthe Pseudo-Random Number GeneratorsJournal of the ACM, 1971
- On primitive trinomials (mod 2), IIInformation and Control, 1969
- Random numbers generated by linear recurrence modulo twoMathematics of Computation, 1965