Article

Free access

Some consequences of the existence of pseudorandom generators

Author:

E. AllenderAuthors Info & Claims

STOC '87: Proceedings of the nineteenth annual ACM symposium on Theory of computing

Pages 151 - 159

https://doi.org/10.1145/28395.28412

Published: 01 January 1987 Publication History

Abstract

If secure pseudorandom generators exist, then probabilistic computation does not uniformly speed up deterministic computation. If sets in P must contain infinitely many noncomplex strings, then nondeterministic computation does not uniformly speed up deterministic computation. Connections are drawn between pseudorandom generation, generalized Kolmogorov complexity, and immunity properties of complexity classes.

References

[1]

L. Adleman, Time,space, and randornnessTechnical Report MIT/LCS/TM-~3~

[2]

L. Adleman and M.-D. Huang, these proceedings.

[3]

M. Ajtai and A. Wigderson., Determirdetie simulation of probabilistic constant depth circuits, Proc. 26th IEEE Symposium on Foundations of Computer Science, pp. 11-19.

Digital Library

[4]

E. W. Allender and It. Rubinstein, P-printable sets, submitted for publication. Preliminary versions of this work may be found in {AI-86, Ru-86}.

[5]

E.W. Allender, The complexity of sparse sets in P, Structure in Complexity Theory Conference, Lecture Notes in Computer Science 223, pp. 1-11.

Digital Library

[6]

J.L. Balcazar and R. V. Book, Sets with small generalized Kolmogorov eomplezity, to appear in Acts Infbrmatica.A preliminary version appeared as On generalized Kolmogorov complezity,Proc. 3rd Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 210, pp. 334-340.

Digital Library

[7]

M. Blum and S. Micali, How to oer terate ~ryptooraphieally strong sequences of pseudo-random bits, SIAM J. Comput. 13, 850-864.

Digital Library

[8]

R. Boppana and ItHirscMeld, Paeudorandom generators and eomp, lezity classes, manuscript, M.I.T.

[9]

G. Brassard, A time.luck tradeoff in relativized cryptography, J. Computer' and System Sciences 22, 280-311.

[10]

G. Chaitin, On the length of programs for computing finite binary sequenees, J. ACM 13, 547-569.

Digital Library

[11]

S. Even, T. Long, and Y. Yacobi, A note on deterministic and nondeterministie time complexity, Information and Control 55, 117-124.

[12]

J. Geske, D. Huynh, and A. Selm~m, A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees, Proc. 4th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Not._.!E.,s in Com._.~ purer Science.

Digital Library

[13]

S. Goldwazser and J. Killian, Almost all primes can be quickly certified, Pros. 18th Annual ACM Symposium on Theory of Computing, pp. 316-329.

Digital Library

[14]

S. Goldwasser and S. Micali, Probabilistic en,ryption, J. Computer and System Sciences 28, 270-299.

[15]

J. Hartmanis, Generalized Kolmogorov complexity and the structure of feasible computations, Proc. 24th IEEE Symposium on Foundations of Computer Science, pp. 439-445.

Digital Library

[16]

L. Hemachandra, Can P and NP manufacture randomnessf, manuscript.

[17]

J. E. Hopcroft and J. D. Ullman, Introduction to Automata The.__~9__~a Lang:~_ages, and Computation, Addison- Wesley, Reading, Mass.

Digital Library

[18]

D. T. Huynh, Resource-bounded Kolmogorov complexity of hard languatles, Structure in Complexity Theory Confor once, Lecture Notesin Computer Science 223, pp. 184-195.

Digital Library

[19]

K.-I. Ks, On the notion of infinite pzeu. dorandom sequences, to appear in Theoretical Computer Science,

[20]

K.-I. Ks, P. Orponen, U. SchSning, and O. Watanabe, What is a hard instance of a computational problem? Structure in Complexity Theory Conference, Lecture Notes in Comvuter Science 223, pp. 197-217.

Digital Library

[21]

A. Kolmogorov, Three approaches to the quantitative definition of randomness, Prob. info. Transmission 1, 1-7.

[22]

L. Levin, Universal sequential search problems, Problems Inform. Transmission 9~ 265-266.

[23]

L. Levin, Randomness conservation inequalities; injormation and independence in mathematical theories, Information and Control 61, 15-37.

Digital Library

[24]

L. Levin, One-way /unctions and pseudorandom generators, Proc. 17th Annual A CM Symposium on Theory of Computing, pp. 363-365.

Digital Library

[25]

Luc Longpre, Resource bounded Kolms/orgy complexity, a link between computational complexity and information theory, Doctoral Dissertation, Cornell University.

Digital Library

[26]

G. Peterson, Succinct representations, random strings and complexity classes, Proc. 21st IEEE Symposium on Foundations of Computer Science, pp. 86-95.

Digital Library

[27]

J. Reif and j. Tygar, Efficient parallel pseudo-random number generation, Tech. Report TR-07-84, Harvard University.

[28]

R. Rubinstein, A note on sets with small generalized Kolmogorov complexity, Technical Report TR #86-4, Iowa State University.

[29]

U. SchSning, Complexity and Structure, Lecture Notes in Computer Science 211.

Digital Library

[30]

A. Sh~mir, On the generation of erl/ptographlcalllt strong pseudorandom sequences, A CM Transactions on Computer Systems 1, 38-44.

Digital Library

[31]

M. Sipser, A complexity theoretic approach to randomness, Proc. 15th Annual ACM Symposium on Theory of Computing, pp. 330-335.

Digital Library

[32]

M. Sipser, Personal Communication.

[33]

O. Watanabe, Generalized Kolmogorov complezitli of computations, manuscript.

[34]

R. Wilber, Randomness and the densitlt of hard problems, Proc. 24th IEEE Symposium on Foundations of Computer Science, pp. 335-342.

Digital Library

[35]

A. Yao, Theory and applications of trapdoor functions, Proc. 23rd IEEE Symposium on Foundations of Computer Science, pp. 80-91.

Cited By

Allender E(2020)Ker-I Ko and the Study of Resource-Bounded Kolmogorov ComplexityComplexity and Approximation10.1007/978-3-030-41672-0_2(8-18)Online publication date: 21-Feb-2020
https://doi.org/10.1007/978-3-030-41672-0_2
Han YHemaspaandra L(2005)Pseudorandom generators and the frequency of simplicitySTACS 9510.1007/3-540-59042-0_61(50-59)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-59042-0_61
Longpré LMocas S(2005)Symmetry of information and one-way functionsISA'91 Algorithms10.1007/3-540-54945-5_75(308-315)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-54945-5_75
Show More Cited By

Index Terms

Some consequences of the existence of pseudorandom generators

Recommendations

Paradigms for Unconditional Pseudorandom Generators

This is a survey of unconditional pseudorandom generators (PRGs). A PRG uses a short, truly random seed to generate a long, "pseudorandom" sequence of bits. To be more specific, for each restricted model of computation (e.g., bounded-depth circuits or ...
Extractors and pseudorandom generators

We introduce a new approach to constructing extractors. Extractors are algorithms that transform a “weakly random” distribution into an almost uniform distribution. Explicit constructions of extractors have a variety of important applications, and tend ...
Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace
STOC 2017: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing

Assume that for every derandomization result for logspace algorithms, there is a pseudorandom generator strong enough to nearly recover the derandomization by iterating over all seeds and taking a majority vote. We prove under a precise version of this ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '87: Proceedings of the nineteenth annual ACM symposium on Theory of computing

January 1987

471 pages

ISBN:0897912217

DOI:10.1145/28395

Editor:
Alfred V. Aho

Copyright © 1987 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1987

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC87

Sponsor:

SIGACT

STOC87: 19th Annual ACM Conference on Theory of Computing

New York, New York, USA

Acceptance Rates

STOC '87 Paper Acceptance Rate 50 of 165 submissions, 30%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
417
Total Downloads

Downloads (Last 12 months)73
Downloads (Last 6 weeks)17

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Allender E(2020)Ker-I Ko and the Study of Resource-Bounded Kolmogorov ComplexityComplexity and Approximation10.1007/978-3-030-41672-0_2(8-18)Online publication date: 21-Feb-2020
https://doi.org/10.1007/978-3-030-41672-0_2
Han YHemaspaandra L(2005)Pseudorandom generators and the frequency of simplicitySTACS 9510.1007/3-540-59042-0_61(50-59)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-59042-0_61
Longpré LMocas S(2005)Symmetry of information and one-way functionsISA'91 Algorithms10.1007/3-540-54945-5_75(308-315)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-54945-5_75
Joseph DSitharam M(2005)Kolmogorov complexity, restricted nondeterminism and generalized spectraSTACS 9010.1007/3-540-52282-4_39(152-164)Online publication date: 6-Jun-2005
https://doi.org/10.1007/3-540-52282-4_39
Han YHemaspaandra L(1996)Pseudorandom generators and the frequency of simplicityJournal of Cryptology10.1007/BF001892639:4(251-261)Online publication date: 1-Sep-1996
https://dl.acm.org/doi/10.1007/BF00189263
Gupta RSmolka SBhaskar S(1994)On randomization in sequential and distributed algorithmsACM Computing Surveys10.1145/174666.17466726:1(7-86)Online publication date: 1-Mar-1994
https://dl.acm.org/doi/10.1145/174666.174667
Varnovsky NVerchenko APrimenko E(1993)Mathematical problems in cryptologyJournal of Soviet Mathematics10.1007/BF0109627167:6(3373-3406)Online publication date: Dec-1993
https://doi.org/10.1007/BF01096271
Watanabe OTang S(1992)On polynomial-time Turing and many—one completeness in PSPACETheoretical Computer Science10.1016/0304-3975(92)90074-P97:2(199-215)Online publication date: 27-Apr-1992
https://dl.acm.org/doi/10.1016/0304-3975%2892%2990074-P
Allender E(1989)The generalized Kolmogorov complexity of sets[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference10.1109/SCT.1989.41824(186-194)Online publication date: 1989
https://doi.org/10.1109/SCT.1989.41824
Lutz J(1989)Almost everywhere high nonuniform complexity[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference10.1109/SCT.1989.41813(37-53)Online publication date: 1989
https://doi.org/10.1109/SCT.1989.41813
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents