On the construction of random number generators and random function generators

From MaRDI portal





[For the entire collection see Zbl 0651.00027.] A random number generator is perfect if it passes all the tests depending on a ``small fraction of the generated bitstring. The complexity of tests is ``not too high. The author proves, that then the sequence of ``ones in the generated sequence is near to 1/2. It is shown that every perfect generator can be converted into a perfect generator with ``standard properties. A survey of new perfect generators is given.











This page was built for publication: On the construction of random number generators and random function generators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813126)