Lower bounds for pseudorandom number generators

Authors:
M. Kharitonov;A. V. Goldberg;M. Yung
Affiliations:
Dept. of Comput. Sci., Stanford Univ., CA, USA;Dept. of Comput. Sci., Stanford Univ., CA, USA;-
Venue:
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Year:
1989

Citing 0
Cited 3

On Pseudorandom Generators in NC

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Universal semantic communication I

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Cryptography in constant parallel time

Cryptography in constant parallel time

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computational resources necessary to generate pseudorandom strings are studied. In particular, lower bounds are proved for pseudorandom number generators, whereas previous research concentrated on upper bounds. The idea of separation of machine-based complexity classes on the basis of their ability (or inability) to generate pseudorandom strings is introduced and investigated.