Construction of RNG using random automata and “one-way” functions

We consider a number of practical issues related to requirements for pseudorandom number generators used for cryptographic software needs. They extend further than general requirements of (practical) indistinguishability of output sequence from the sequence of independent uniformly distributed random variables. We formulate these additional requirements and present a general construction of RNG for usage in cryptographic software that is proposed to meet all of them.