Period of the d-Sequence Based Random Number Generator

2007/12/03 by Thippireddy, Suresh, Chalasani, Sandeep
#Cryptography and Security (cs.CR) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.0712.0411

Abstract

This paper presents an expression to compute the exact period of a recursive random number generator based on d-sequences. Using the multi-recursive version of this generator we can produce large number of pseudorandom sequences.

Related

• Testing D-Sequences for their Randomness
• A Class of Random Sequences for Key Generation
• Recursive Random Number Generator Using Prime Reciprocals
• A Simple construction of the Pseudorandom Generator from Permutation
• The solution to the challenge in "Time-Reversible Random Number Generators" by Wm. G. Hoover and Carol G. Hoover