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.
Recommendations
Cited in
(12)- Local randomness in pseudorandom sequences
- A complexity measure for families of binary sequences
- Pseudorandomness of Camellia-like scheme
- scientific article; zbMATH DE number 3888786 (Why is no real title available?)
- Random number generators based on permutations can pass the collision test
- A random number generator based on Weierstrass function
- Post-Processing Functions for a Biased Physical Random Number Generator
- Probabilistic analysis of elementary randomizers
- scientific article; zbMATH DE number 697814 (Why is no real title available?)
- scientific article; zbMATH DE number 7300370 (Why is no real title available?)
- Bounds for the number of rounds with impossible differences in generalized Feistel schemes
- scientific article; zbMATH DE number 4182680 (Why is no real title available?)
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)