DocumentCode
2139327
Title
Lower bounds for pseudorandom number generators
Author
Kharitonov, Michael ; Goldberg, Andrew V. ; Yung, Moti
Author_Institution
Dept. of Comput. Sci., Stanford Univ., CA, USA
fYear
1989
fDate
30 Oct-1 Nov 1989
Firstpage
242
Lastpage
247
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
Keywords
computational complexity; random number generation; lower bounds; machine-based complexity; pseudorandom number generators; Algorithm design and analysis; Computer science; Cryptography; Polynomials; Predictive models; Random number generation; Sufficient conditions; Testing; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1989., 30th Annual Symposium on
Conference_Location
Research Triangle Park, NC
Print_ISBN
0-8186-1982-1
Type
conf
DOI
10.1109/SFCS.1989.63485
Filename
63485
Link To Document