On the Existence of Pseudorandom Generators
Abstract
Pseudorandom generators (suggested and developed by Blum and Micali and Yao) are efficient deterministic programs that expand a randomly selected k-bit seed into a much longer pseudorandom bit sequence that is indistinguishable in polynomial time from an (equally long) sequence of unbiased coin tosses. A fundamental question is to find simple conditions, as the existence of one-way functions, which suffice for constructing pseudorandom generators. This paper considers regular functions, in which every image of a k-bit string has the same number of preimages of length k. This paper shows how to construct pseudorandom generators from any regular one-way function.
MSC codes
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
W. Alexi, B. Chor, O. Goldreich, C. P. Schnorr, RSA and Rabin functions: certain parts are as hard as the whole, SIAM J. Comput., 17 (1988), 194–209
2.
L. Blum, M. Blum, M. Shub, A simple unpredictable pseudorandom number generator, SIAM J. Comput., 15 (1986), 364–383
3.
Manuel Blum, Silvio Micali, How to generate cryptographically strong sequences of pseudorandom bits, SIAM J. Comput., 13 (1984), 850–864
4.
J. Carter, M. Wegman, Universal classes of hash functions, J. Comput. System Sci., 18 (1979), 143–154
5.
Benny Chor, Oded Goldreich, On the power of two-point based sampling, J. Complexity, 5 (1989), 96–106
6.
Benny Chor, Oded Goldreich, Shafi Goldwasser, H. C. Williams, The bit security of modular squaring given partial factorization of the modulosAdvances in cryptology—CRYPTO '85 (Santa Barbara, Calif., 1985), Lecture Notes in Comput. Sci., Vol. 218, Springer, Berlin, 1986, 448–457
7.
Whitfield Diffie, Martin E. Hellman, New directions in cryptography, IEEE Trans. Information Theory, IT-22 (1976), 644–654, Nov.
8.
Shimon Even, Graph algorithms, Computer Science Press Inc., Woodland Hills, Calif., 1979ix+249
9.
Oded Goldreich, Shafi Goldwasser, Silvio Micali, How to construct random functions, J. Assoc. Comput. Mach., 33 (1986), 792–807
10.
O. Goldreich, H. Kawczyk, M. Luby, On the existence of pseudorandom generators, Proc. 29th IEEE Symposium on Foundations of Computer Science, 1988, 12–24
11.
O. Goldreich, L. A. Levin, A hard-core predicate for any one-way function, Proc. 21st Symposium on Theory of Computing, 1989, 25–32
12.
O. Goldreich, S. Micali, The Weakest Pseudorandom Bit Generator Implies the Strongest One, 1984, manuscript
13.
Shafi Goldwasser, Silvio Micali, Probabilistic encryption, J. Comput. System Sci., 28 (1984), 270–299
14.
J. Hastad, Pseudo-random generators under uniform assumptions, Proc. 22nd Symposium on Theory of Computing, 1990, 395–404
15.
R. Impagliazzo, L. A. Levin, M. G. Luby, Pseudo-random generation from one-way functions, Proc. 21st Symposium on Theory of Computing, 1989, 12–24
16.
A. Joffe, On a set of almost deterministic k-independent random variables, Ann. Probability, 2 (1974), 161–162
17.
L. A. Levin, One way functions and pseudorandom generators, Combinatorica, 7 (1987), 357–363, a preliminary version appeared in Proc. 17th Symposium on Theory of Computing, 1985, pp. 363–365
18.
L. A. Levin, Homogeneous measures and polynomial time invariants, Proc. 29th IEEE Symposium on Foundations of Computer Science, 1988, 36–41
19.
Michael Luby, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput., 15 (1986), 1036–1053
20.
Michael Luby, Charles Rackoff, How to construct pseudorandom permutations from pseudorandom functions, SIAM J. Comput., 17 (1988), 373–386
21.
F J. McWilliams, N. J. A. Sloane, The Theory of Error Correcting Codes, North-Holland Publishing Company, Amsterdam, 1977
22.
M. O. Rabin, Digitalized Signatures and Public Key Functions as Intractable as Factoring, 1979, MIT/LCS/TR-212
23.
R. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM, 21 (1978), 120–126
24.
A. Shamir, On the generation of cryptrographically strong pseudorandom sequences, ACM Trans. Cormput. Systems, 1 (1983), 38–44
25.
Andrew C. Yao, Theory and applications of trapdoor functions23rd annual symposium on foundations of computer science (Chicago, Ill., 1982), IEEE, New York, 1982, 80–91
Information & Authors
Information
Published In
Copyright
Copyright © 1993 © Society for Industrial and Applied Mathematics.
History
Submitted: 20 April 1989
Accepted: 1 July 1992
Published online: 31 July 2006
MSC codes
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Simple Constructions from (Almost) Regular One-Way FunctionsJournal of Cryptology, Vol. 37, No. 3 | 30 May 2024
- Cryptographic obfuscation for smart contracts: Trustless bitcoin bridge and moreBlockchain: Research and Applications, Vol. 4, No. 1 | 1 Mar 2023
- On the Possibility of Basing Cryptography on $$\mathsf{EXP}\ne \mathsf{BPP}$$Advances in Cryptology – CRYPTO 2021 | 11 August 2021
- Simple Constructions from (Almost) Regular One-Way FunctionsTheory of Cryptography | 4 November 2021
- Tight Quantum Time-Space Tradeoffs for Function Inversion2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) | 1 Nov 2020
- On One-way Functions and Kolmogorov Complexity2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) | 1 Nov 2020
- Batch Verification for Statistical Zero Knowledge ProofsTheory of Cryptography | 9 December 2020
- The Function-Inversion Problem: Barriers and OpportunitiesTheory of Cryptography | 22 November 2019
- Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private ComputationTheory of Cryptography | 22 November 2019
- New Pseudorandom Number Generators from Block Ciphers2017 IEEE Second International Conference on Data Science in Cyberspace (DSC) | 1 Jun 2017
- Secure Arithmetic Computation with Constant Computational OverheadAdvances in Cryptology – CRYPTO 2017 | 29 July 2017
- Notice of Removal: New pseudorandom number generators from block ciphers2017 ISEA Asia Security and Privacy (ISEASP) | 1 Jan 2017
- Garbling XOR Gates “For Free” in the Standard ModelJournal of Cryptology, Vol. 29, No. 3 | 20 March 2015
- Towards Sound Fresh Re-keying with Hard (Physical) Learning ProblemsAdvances in Cryptology – CRYPTO 2016 | 21 July 2016
- Pseudoentropy: Lower-Bounds for Chain Rules and TransformationsTheory of Cryptography | 22 October 2016
- On the Complexity of Constructing Pseudorandom Functions (Especially when They Don’t Exist)Journal of Cryptology, Vol. 28, No. 3 | 13 November 2013
- Pseudorandom generators from regular one-way functions: New constructions with improved parametersTheoretical Computer Science, Vol. 569 | 1 Mar 2015
- The Randomized Iterate, Revisited - Almost Linear Seed Length PRGs from a Broader Class of One-Way FunctionsTheory of Cryptography | 1 Jan 2015
- (Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and BeyondAdvances in Cryptology -- CRYPTO 2015 | 1 August 2015
- On linear-size pseudorandom generators and hardcore functionsTheoretical Computer Science, Vol. 554 | 1 Oct 2014
- Pseudorandom Generators Based on One-Way FunctionsApplied Mechanics and Materials, Vol. 577 | 1 July 2014
- On Pseudorandom Generators with Linear Stretch in NC 0Cryptography in Constant Parallel Time | 1 Jan 2014
- Cryptography with Constant Input LocalityCryptography in Constant Parallel Time | 1 Jan 2014
- Computational ComplexityComputational Logic | 1 Jan 2014
- Sharing Privacy Protected and Statistically Sound Clinical Research Data Using Outsourced Data StorageJournal of Applied Mathematics, Vol. 2014 | 1 Jan 2014
- Resource-based corruptions and the combinatorics of hidden diversityProceedings of the 4th conference on Innovations in Theoretical Computer Science | 9 January 2013
- Efficiency Improvements in Constructing Pseudorandom Generators from One-Way FunctionsSIAM Journal on Computing, Vol. 42, No. 3 | 25 June 2013
- Pseudorandom Generators with Long Stretch and Low Locality from Random Local One-Way FunctionsSIAM Journal on Computing, Vol. 42, No. 5 | 24 October 2013
- Garbling XOR Gates “For Free” in the Standard ModelTheory of Cryptography | 1 Jan 2013
- On Linear-Size Pseudorandom Generators and Hardcore FunctionsComputing and Combinatorics | 1 Jan 2013
- Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFsAdvances in Cryptology – CRYPTO 2013 | 1 Jan 2013
- Pseudorandom Generators from Regular One-Way Functions: New Constructions with Improved ParametersAdvances in Cryptology - ASIACRYPT 2013 | 1 Jan 2013
- Input Locality and Hardness AmplificationJournal of Cryptology, Vol. 26, No. 1 | 10 December 2011
- Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls2012 IEEE 53rd Annual Symposium on Foundations of Computer Science | 1 Oct 2012
- Pseudorandom generators with long stretch and low locality from random local one-way functionsProceedings of the forty-fourth annual ACM symposium on Theory of computing | 19 May 2012
- A New Pseudorandom Generator from Collision-Resistant Hash FunctionsTopics in Cryptology – CT-RSA 2012 | 1 Jan 2012
- The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of PrimitivesAdvances in Cryptology – CRYPTO 2012 | 1 Jan 2012
- Zero-Knowledge Proofs via Polynomial RepresentationsMathematical Foundations of Computer Science 2012 | 1 Jan 2012
- UOWHFs from OWFs: Trading Regularity for EfficiencyProgress in Cryptology – LATINCRYPT 2012 | 1 Jan 2012
- The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way FunctionsAdvances in Cryptology – ASIACRYPT 2012 | 1 Jan 2012
- A New Efficient Secure Multi-Party ComputationApplied Mechanics and Materials, Vol. 109 | 1 October 2011
- Relativized Separations of Worst-Case and Average-Case Complexities for NP2011 IEEE 26th Annual Conference on Computational Complexity | 1 Jun 2011
- On the Power of the Randomized IterateSIAM Journal on Computing, Vol. 40, No. 6 | 6 December 2011
- Input Locality and Hardness AmplificationTheory of Cryptography | 1 Jan 2011
- On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom GeneratorsTheory of Cryptography | 1 Jan 2011
- On Constructing 1-1 One-Way FunctionsStudies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation | 1 Jan 2011
- Collision-Free Hashing from Lattice ProblemsStudies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation | 1 Jan 2011
- Electronic Protocols for Voting and Bidding Based on Secure Multi-Party ProofAdvanced Materials Research, Vol. 171-172 | 1 December 2010
- Public-key cryptography from different assumptionsProceedings of the forty-second ACM symposium on Theory of computing | 5 June 2010
- Efficiency improvements in constructing pseudorandom generators from one-way functionsProceedings of the forty-second ACM symposium on Theory of computing | 5 June 2010
- A Message Recognition Protocol Based on Standard AssumptionsApplied Cryptography and Network Security | 1 Jan 2010
- Secure Multi-Party Proof and its ApplicationsJournal of Software Engineering and Applications, Vol. 03, No. 07 | 1 Jan 2010
- Cryptography with Constant Input LocalityJournal of Cryptology, Vol. 22, No. 4 | 11 April 2009
- Reducing Complexity Assumptions for Statistically-Hiding CommitmentJournal of Cryptology, Vol. 22, No. 3 | 22 September 2007
- Saving Private Randomness in One-Way Functions and Pseudorandom GeneratorsTheory of Cryptography | 1 Jan 2008
- Cryptography with Constant Input LocalityAdvances in Cryptology - CRYPTO 2007 | 1 Jan 2007
- Reducing Complexity Assumptions for Statistically-Hiding Commitment*SSRN Electronic Journal, Vol. 7 | 1 Jan 2007
- On basing one-way functions on NP-hardnessProceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 21 May 2006
- Cryptography in $NC^0$SIAM Journal on Computing, Vol. 36, No. 4 | 15 December 2006
- Pseudorandom Generators from One-Way Functions: A Simple Construction for Any HardnessTheory of Cryptography | 1 Jan 2006
- Efficient Pseudorandom Generators from Exponentially Hard One-Way FunctionsAutomata, Languages and Programming | 1 Jan 2006
- On the Power of the Randomized IterateAdvances in Cryptology - CRYPTO 2006 | 1 Jan 2006
- On Pseudorandom Generators with Linear Stretch in NC0 Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 1 Jan 2006
- Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-Hardness21st Annual IEEE Conference on Computational Complexity (CCC'06) | 1 Jan 2006
- Reducing Complexity Assumptions for Statistically-Hiding CommitmentAdvances in Cryptology – EUROCRYPT 2005 | 1 Jan 2005
- On Constructing Parallel Pseudorandom Generators from One-Way Functions20th Annual IEEE Conference on Computational Complexity (CCC'05) | 1 Jan 2005
- Randomness vs Time: Derandomization under a Uniform AssumptionJournal of Computer and System Sciences, Vol. 63, No. 4 | 1 Dec 2001
- How to turn loaded dice into fair coinsIEEE Transactions on Information Theory, Vol. 46, No. 3 | 1 May 2000
- PseudorandomnessAutomata, Languages and Programming | 18 February 2002
- Security-preserving hardness-amplification for any regular one-way functionProceedings of the thirty-first annual ACM symposium on Theory of Computing | 1 May 1999
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, Vol. 28, No. 4 | 28 July 2006
- Zeta functions, one-way functions, and pseudorandom number generatorsDuke Mathematical Journal, Vol. 88, No. 2 | 1 Jun 1997
- Pseudorandom generators and the frequency of simplicityJournal of Cryptology, Vol. 9, No. 4 | 1 Sep 1996
- Pseudorandom generators and the frequency of simplicitySTACS 95 | 1 June 2005
- My favorite ten complexity theorems of the past decadeFoundation of Software Technology and Theoretical Computer Science | 1 June 2005
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].