{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:17:44Z","timestamp":1725488264278},"publisher-location":"New York, NY","reference-count":24,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387971964"},{"type":"electronic","value":"9780387347998"}],"license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/0-387-34799-2_12","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:17:36Z","timestamp":1186363056000},"page":"146-162","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Existence of Pseudorandom Generators"],"prefix":"10.1007","author":[{"given":"Oded","family":"Goldreich","sequence":"first","affiliation":[]},{"given":"Hugo","family":"Krawczyk","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Luby","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,12,1]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"W. Alexi, B. Chor, O. Goldreich and C.P. Schnorr, \u201cRSA and Rabin Functions: Certain Parts Arc As Hard As the Whole\u201d, SIAM Jour. on Computing, Vol. 17, 1988, pp. 194\u2013209.","journal-title":"SIAM Jour. on Computing"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"L. Blum, M. Blum and M. Shub, A Simple Secure Unpredictable Pseudo-Random Number Generator, SIAM Jour. on Computing, Vol. 15, 1986, pp. 364\u2013383.","journal-title":"SIAM Jour. on Computing"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M, and Micali, S., \u201cHow to Generate Cryptographically Strong Sequences of Pseudo-Random Bits\u201d, SIAM Jour. on Computing, Vol. 13, 1984, pp. 850\u2013864.","journal-title":"SIAM Jour. on Computing"},{"key":"12_CR4","first-page":"143","volume":"18","author":"J. Carter","year":"1979","unstructured":"Carter, J., and M. Wegman, \u201cUniversal Classes of Hash Functions\u201d, JCSS, 1979, Vol. 18, pp. 143\u2013154.","journal-title":"JCSS"},{"key":"12_CR5","unstructured":"Chor, B., and O. Goldreich, \u201cOn the Power of Two-Point Sampling\u201d, to appear in Jour. of Complexity."},{"key":"12_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/3-540-39799-X_35","volume-title":"Advances in Cryptology-Crypto 85 Proceedings","author":"B. Chor","year":"1985","unstructured":"Chor, B., O. Goldreich, and S. Goldwasser, \u201cThe Bit Security of Modular Squaring Given Partial Factorization of the Modulos\u201d, Advances in Cryptology-Crypto 85 Proceedings, ed. H.C. Williams, Lecture Notes in Computer Science, 218, Springer Verlag, 1985, pp. 448\u2013457."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie, and M. E. Hellman, \u201cNew Directions in Cryptography\u201d, IEEE transactions on Info. Theory, IT-22 (Nov. 1976), pp. 644\u2013654","journal-title":"IEEE transactions on Info. Theory"},{"key":"12_CR8","unstructured":"S. Even, Graph Algorithms, Computer Science Press, 1979."},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., S. Goldwasser, and S. Micali, \u201cHow to Construct Random Functions\u201d, Jour. of ACM, Vol. 33, No. 4, 1986, pp. 792\u2013807.","journal-title":"Jour. of ACM"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Goldreich, O., H. Krawczyk and M. Luby, \u201cOn the Existence of Pseudorandom Generators\u201d, Proc. 29th IEEE Symp. on Foundations of Computer Science, 1988, pp 12\u201324.","DOI":"10.1109\/SFCS.1988.21917"},{"key":"12_CR11","unstructured":"Goldreich, O., and L.A. Levin, \u201cA Hard-Core Predicate for any One-Way Function\u201d, in preparations."},{"key":"12_CR12","unstructured":"Goldreich, O., and S. Micali, \u201cThe Weakest Pseudorandom Bit Generator Implies the Strongest One\u201d, manuscript, 1984."},{"key":"12_CR13","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., and S. Micali, \u201cProbabilistic Encryption\u201d, JCSS, Vol. 28, No. 2, 1984, pp. 270\u2013299.","journal-title":"JCSS"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., L.A., Levin and M.G. Luby, \u201cPseudorandom Number Generation from any One-Way Function\u201d, preprint, 1988.","DOI":"10.1145\/73007.73009"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1214\/aop\/1176996762","volume":"2","author":"A. Joffe","year":"1974","unstructured":"A. Joffe, \u201cOn a Set of Almost Deterministic k-Independent Random Variables\u201d, the Annals of Probability, 1974, Vol. 2, No. 1, pp. 161\u2013162.","journal-title":"the Annals of Probability"},{"issue":"4","key":"12_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02579323","volume":"7","author":"L.A. Levin","year":"1987","unstructured":"L.A. Levin, \u201cOne-Way Function and Pseudorandom Generators\u201d, Combinatorica, Vol. 7, No. 4, 1987, pp. 357\u2013363. A preliminary version appeared in Proc. 17th STOC, 1985, pp. 363\u2013365.","journal-title":"Combinatorica"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"L.A. Levin, \u201cHomogeneous Measures and Polynomial Time Invariants\u201d, Proc. 29th IEEE Symp. on Foundations of Computer Science, 1988, pp 36\u201341.","DOI":"10.1109\/SFCS.1988.21919"},{"issue":"4","key":"12_CR18","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M. Luby","year":"1986","unstructured":"M. Luby, \u201cA Simple Parallel Algorithm for the Maximal Independent Set Problem\u201d, SIAM J. Comput., Vol. 15, No. 4, Nov. 1986, pp. 1036\u20131054.","journal-title":"SIAM J. Comput."},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"M. Luby and C. Rackoff, \u201cHow to Construct Pseudorandom Permutations From Pseudorandom Functions\u201d, SIAM Jour. on Computing, Vol. 17, 1988, pp. 373\u2013386.","journal-title":"SIAM Jour. on Computing"},{"key":"12_CR20","unstructured":"McWilliams, F.J., and N.J.A. Sloane, The Theory of Error Correcting Codes, North-Holland Publishing Company, 1977."},{"key":"12_CR21","unstructured":"M.O. Rabin, \u201cDigitalized Signatures and Public Key Functions as Intractable as Factoring\u201d, MIT\/LCS\/TR-212, 1979."},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir, and L. Adleman, \u201cA Method for Obtaining Digital Signatures and Public Key Cryptosystems\u201d, Comm. ACM, Vol. 21, Feb. 1978, pp 120\u2013126","journal-title":"Comm. ACM"},{"issue":"1","key":"12_CR23","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/357353.357357","volume":"1","author":"A. Shamir","year":"1983","unstructured":"A. Shamir, \u201cOn the Generation of Cryptographically Strong Pseudorandom Sequences\u201d, ACM Transaction on Computer Systems, Vol. 1, No. 1, February 1983, pp. 38\u201344.","journal-title":"ACM Transaction on Computer Systems"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Yao, A.C., \u201cTheory and Applications of Trapdoor Functions\u201d, Proc. of the 23rd IEEE Symp. on Foundation of Computer Science, 1982, pp. 80\u201391.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-34799-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T17:58:47Z","timestamp":1684000727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-34799-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9780387971964","9780387347998"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/0-387-34799-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]},"assertion":[{"value":"1 December 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}