Partitioning the Period of a Class of m -Sequences and Application to Pseudorandom Number Generation

DOI10.1145/322092.322106zbMath0402.65003OpenAlexW1971977555MaRDI QIDQ4187225

Alexis C. Arvillias, Dimitris G. Maritsas

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

zbMATH Keywords

Primitive PolynomialsPseudorandom Number GenerationFeedback Shift RegistersEquipartition of M- SequencesGfsrKey GeneratorsLewis and PayneLinear RecurrencesM-SequencesPseudorandom Number GeneratorsTausworthe GeneratorsTootill

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10)

Related Items (8)

A comparative study of some pseudorandom number generators ⋮ Development and testing of a high precision digital Gaussian generator for computers ⋮ 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 ⋮ Recent trends in random number and random vector generation ⋮ Maximum-length sequences, cellular automata, and random numbers ⋮ Increasing the orders of equidistribution of the leading bits of the Tausworthe sequence ⋮ Matrices and the structure of random number sequences

This page was built for publication: Partitioning the Period of a Class of m -Sequences and Application to Pseudorandom Number Generation