A Full Cycle Length Pseudorandom Number Generator Based on Compositions of Automata
In this paper a new Pseudorandom Number Generator based on compositions of abstract automata is presented. We show that it has full cycle with length of 2^128. It is also shown that the output satisfies the statistical requirements of the NIST randomness test suite.
This work is licensed under a Creative Commons Attribution 3.0 License.