Partitioning the Period of a Class of m -Sequences and Application to Pseudorandom Number Generation
From MaRDI portal
Publication:4187225
DOI10.1145/322092.322106zbMath0402.65003MaRDI QIDQ4187225
Dimitris G. Maritsas, Alexis C. Arvillias
Publication date: 1978
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322092.322106
Primitive Polynomials; Pseudorandom Number Generation; Feedback Shift Registers; Equipartition of M- Sequences; Gfsr; Key Generators; Lewis and Payne; Linear Recurrences; M-Sequences; Pseudorandom Number Generators; Tausworthe Generators; Tootill
65C10: Random number generation in numerical analysis
Related Items
Random number generation with the recursion \(X_ t=X_{t-3p}\oplus X_{t-3q}\), An equivalence relation between Tausworthe and GFSR sequences and applications, Increasing the orders of equidistribution of the leading bits of the Tausworthe sequence, Matrices and the structure of random number sequences, Development and testing of a high precision digital Gaussian generator for computers, Recent trends in random number and random vector generation, A comparative study of some pseudorandom number generators, Maximum-length sequences, cellular automata, and random numbers