{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:04:23Z","timestamp":1775282663754,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1987,12]]},"DOI":"10.1007\/bf02579323","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T22:20:05Z","timestamp":1174602005000},"page":"357-363","source":"Crossref","is-referenced-by-count":167,"title":["One way functions and pseudorandom generators"],"prefix":"10.1007","volume":"7","author":[{"given":"Leonid A.","family":"Levin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579323_CR1","doi-asserted-by":"crossref","unstructured":"L. Blum, M. Blum andM. Shub, A Simple Secure Pseudo-Random Number Generator,Advances in Cryptology (ed. D. Chaum, R. L. Rivest and A. T. Sherman), Plenum Press, 1983, 61\u201378.","DOI":"10.1007\/978-1-4757-0602-4_6"},{"key":"BF02579323_CR2","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum andS. Micali, How to generate Crytographically Strong Sequences of Pseudo Random Bits,FOCS Symp. Proc. (1982);SIAM J. on Computing,13 (1984), 850\u2013864.","journal-title":"SIAM J. on Computing"},{"key":"BF02579323_CR3","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"O. Goldreich","year":"1984","unstructured":"O. Goldreich, S. Goldwasser andS. Micali, How to Construct Random Functions,Proc. 25th Symp. on Foundations of Computer Science (1984);SIAM J. on Computing,13 (1984), 850\u2013864.","journal-title":"SIAM J. on Computing"},{"key":"BF02579323_CR4","doi-asserted-by":"crossref","unstructured":"S. Goldwasser,Probabilistic Encryption: Theory and Applications, Ph. D. Dissert, University of California at Berkeley (1984), Section 4.2.3.","DOI":"10.1016\/0022-0000(84)90070-9"},{"issue":"5","key":"BF02579323_CR5","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1109\/TIT.1972.1054893","volume":"IT-18","author":"J. Justesen","year":"1972","unstructured":"J. Justesen, A class of constructive, asymptotically-good, algebraic codes,IEEE Trans. Inform. Theory,IT-18, 5, (1972), 652\u2013656.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"BF02579323_CR6","unstructured":"A. N. Kolmogorov, Three Approaches to the Concept of the Amount of Information,Probl. Inf. Transm. (1965), 1\/1."},{"key":"BF02579323_CR7","doi-asserted-by":"crossref","unstructured":"L. Levin, Average Case Complete Problems,SIAM J. Comput. (1986), 285\u2013286.","DOI":"10.1137\/0215020"},{"key":"BF02579323_CR8","doi-asserted-by":"crossref","unstructured":"L. Levin, Randomness Conservation Inequalities,Information and Control 61 (1984), section 1.3; In less detail in Theorem 2 of Universal Sequential Search Problems,Probl. Inf. Transm. 9 (1973).","DOI":"10.1016\/S0019-9958(84)80060-1"},{"key":"BF02579323_CR9","unstructured":"C. Rackoff, Personal communication, (1985)."},{"key":"BF02579323_CR10","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/357353.357357","volume":"1","author":"A. Shamir","year":"1983","unstructured":"A. Shamir, On the Generation of Cryptographically Strong Pseudo-Random Sequences,ACM Trans. on Comp. Syst. 1, (1983), 38\u201344.","journal-title":"ACM Trans. on Comp. Syst."},{"key":"BF02579323_CR11","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","volume":"54","author":"A. D. Wyner","year":"1975","unstructured":"A. D. Wyner, The wire-tap channel,Bell System Technical Journal 54, (1975), 1355\u20131387.","journal-title":"Bell System Technical Journal"},{"key":"BF02579323_CR12","doi-asserted-by":"crossref","unstructured":"A. C. Yao, Theory and Applications of Trapdoor Functions,Proc. 23rd IEEE Symp. on Foundations of Computer Science (1982), 80\u201391.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579323.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579323\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579323","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:45:02Z","timestamp":1558197902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579323"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["BF02579323"],"URL":"https:\/\/doi.org\/10.1007\/bf02579323","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}