Efficient, perfect polynomial random number generators
From MaRDI portal
DOI10.1007/BF00196909zbMATH Open0733.65003MaRDI QIDQ809536FDOQ809536
Authors: Silvio Micali, Claus Peter Schnorr 
Publication date: 1991
Published in: Journal of Cryptology (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 4182680
- On the statistical independence of nonlinear congruential pseudorandom numbers
- Statistical independence of nonlinear congruential pseudorandom numbers
- Remarks on nonlinear congruential pseudorandom numbers
- On the adequacy of pseudy-random number generators (or: How big a period do we need?)
pseudorandom number generatorscomplexity lower boundspolynomial generatorperfect generatorpolynomial-time statistical testRSA-scheme
Random number generation in numerical analysis (65C10) Complexity and performance of numerical algorithms (65Y20) Cryptography (94A60)
Cites Work
- Title not available (Why is that?)
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- A Fast Monte-Carlo Test for Primality
- A Simple Unpredictable Pseudo-Random Number Generator
- Title not available (Why is that?)
- Title not available (Why is that?)
- RSA and Rabin Functions: Certain Parts are as Hard as the Whole
- Statistical independence of nonlinear congruential pseudorandom numbers
Cited In (8)
- On \(p\)-adic functions preserving Haar measure
- An optimal random number generator on \({\mathbb{Z}}_ p\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on local randomness in polynomial random number and random function generators
- On the possibility of a backdoor in the Micali-Schnorr generator
- Local Randomness in Polynomial Random Number and Random Function Generators
- Title not available (Why is that?)
This page was built for publication: Efficient, perfect polynomial random number generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809536)
