{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T08:13:23Z","timestamp":1787386403623,"version":"build-2736575974"},"reference-count":25,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1993,12]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1137\/0222069","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:38:56Z","timestamp":1109227136000},"page":"1163-1175","source":"Crossref","is-referenced-by-count":81,"title":["On the Existence of Pseudorandom Generators"],"prefix":"10.1137","volume":"22","author":[{"given":"Oded","family":"Goldreich","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hugo","family":"Krawczyk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Luby","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1137\/0217013"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1137\/0215025"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/0213053"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(89)90015-0"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39799-X_35"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"R8","volume-title":"Graph algorithms","author":"Even Shimon","year":"1979"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"O. Goldreich, H. Kawczyk, M. Luby,  On the existence of pseudorandom generators,  Proc. 29th IEEE Symposium on Foundations of Computer Science,  1988,  12\u201324","DOI":"10.1109\/SFCS.1988.21917"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"O. Goldreich, L. A. Levin,  A hard-core predicate for any one-way function,  Proc. 21st Symposium on Theory of Computing,  1989,  25\u201332","DOI":"10.1145\/73007.73010"},{"key":"R12","unstructured":"O. Goldreich, S. Micali,  The Weakest Pseudorandom Bit Generator Implies the Strongest One,  1984, manuscript"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"J. Hastad,  Pseudo-random generators under uniform assumptions,  Proc. 22nd Symposium on Theory of Computing,  1990,  395\u2013404","DOI":"10.1145\/100216.100270"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L. A. Levin, M. G. Luby,  Pseudo-random generation from one-way functions,  Proc. 21st Symposium on Theory of Computing,  1989,  12\u201324","DOI":"10.1145\/73007.73009"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996762"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579323"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"L. A. Levin,  Homogeneous measures and polynomial time invariants,  Proc. 29th IEEE Symposium on Foundations of Computer Science,  1988,  36\u201341","DOI":"10.1109\/SFCS.1988.21919"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1137\/0215074"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1137\/0217022"},{"key":"R21","volume-title":"The Theory of Error Correcting Codes","author":"McWilliams F J.","year":"1977"},{"key":"R22","unstructured":"M. O. Rabin,  Digitalized Signatures and Public Key Functions as Intractable as Factoring,  1979, MIT\/LCS\/TR-212"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1145\/357353.357357"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0222069","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:55:06Z","timestamp":1787338506000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0222069"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["10.1137\/0222069"],"URL":"https:\/\/doi.org\/10.1137\/0222069","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}