Abstract
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.
Highlights
In this paper, the authors continue their joint research of cryptographic tools based on compositions of abstract finite automata started in [6].Random number generators have been used for a wide variety of fields and purposes, such as cryptography, pattern recognition, gambling and VLSI testing. [18]
The most frequent type of automata theory based pseudorandom generators are implemented on the basis of cellular automata
The first pseudorandom number generator based on cellular automata was proposed by S
Summary
The authors continue their joint research of cryptographic tools based on compositions of abstract finite automata started in [6]. A common problem of some well-known pseudorandom generators based on cellular automata is that they have serious application difficulties: some of them can be broken [1],[17], while in case of others the selection of the key automaton poses difficulties [10]. A counter based random number generator (CBRNG) is a structure CBRN G = (K, ZJ , S, f, U, g), where K is the key space; ZJ = {0, 1, ..., J − 1}, where J is a positive integer called output multiplicity; S is the state space; U is the output space; f : S → S is the state transition function, si = f (si−1); g : K × ZJ × S → U is the output function. Applying the ideas of this construction, in this paper we consider CBRNGs, where f is a counter, and g is defined by composition of abstract finite automata
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
