Efficient, perfect polynomial random number generators

DOI10.1007/BF00196909zbMath0733.65003MaRDI QIDQ809536

Claus Peter Schnorr, Silvio Micali

Publication date: 1991

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

polynomial generatorpseudorandom number generatorscomplexity lower boundsperfect generatorpolynomial-time statistical testRSA-scheme

Mathematics Subject Classification ID

Cryptography (94A60) Random number generation in numerical analysis (65C10) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Statistical independence of nonlinear congruential pseudorandom numbers
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A Simple Unpredictable Pseudo-Random Number Generator
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• A Fast Monte-Carlo Test for Primality
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient, perfect polynomial random number generators