Design of Practical and Provably Good Random Number Generators
From MaRDI portal
Cited in
(20)- Implementation of a random number generator in OCCAM
- On some properties of PRNGs based on block ciphers in counter mode
- Guaranteeing the diversity of number generators
- Efficient deterministic and non-deterministic pseudorandom number generation
- Separation of random number generation and resolvability
- Time-analysis of pseudorandom bit generators
- An analytic approach to secure pseudo-random generation
- Sponge-based pseudo-random number generators
- How to Strengthen Pseudo-random Generators by Using Compression
- The Current Status in Design of Efficient Provably Secure Cryptographic Pseudorandom Generators
- scientific article; zbMATH DE number 3919629 (Why is no real title available?)
- scientific article; zbMATH DE number 1954177 (Why is no real title available?)
- Secure and fast encryption (SAFE) with classical random number generators
- scientific article; zbMATH DE number 2086718 (Why is no real title available?)
- scientific article; zbMATH DE number 1878326 (Why is no real title available?)
- scientific article; zbMATH DE number 910854 (Why is no real title available?)
- scientific article; zbMATH DE number 1418260 (Why is no real title available?)
- Construction of RNG using random automata and ``one-way functions
- MaD0: an ultrafast nonlinear pseudorandom number generator
- KISS: a bit too simple
This page was built for publication: Design of Practical and Provably Good Random Number Generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4225868)
