{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:17:32Z","timestamp":1781259452971,"version":"3.54.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1993,5]]},"DOI":"10.1016\/0020-0190(93)90204-m","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"95-100","source":"Crossref","is-referenced-by-count":15,"title":["Symmetry of information and one-way functions"],"prefix":"10.1016","volume":"46","author":[{"given":"Luc","family":"Longpr\u00e9","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sarah","family":"Mocas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(93)90204-M_BIB1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0022-0000(89)90021-4","article-title":"Some consequences of the existence of pseudorandom generators","volume":"39","author":"Allender","year":"1989","journal-title":"J. Comp. System Sci."},{"key":"10.1016\/0020-0190(93)90204-M_BIB2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/321495.321506","article-title":"On the length of programs for computing finite binary sequences: statistical considerations","volume":"16","author":"Chaitin","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0190(93)90204-M_BIB3","first-page":"1477","article-title":"On the symmetry of algorithmic information","volume":"15","author":"G\u00e1cs","year":"1974","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0020-0190(93)90204-M_BIB4","first-page":"25","article-title":"On the existence of pseudo-random generators","author":"Goldreich","year":"1989","journal-title":"Proc. 21st ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(93)90204-M_BIB5","first-page":"439","article-title":"Generalized Kolmogorov complexity and the structure of feasible computations","author":"Hartmanis","year":"1983","journal-title":"Proc. 24th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(93)90204-M_BIB6","first-page":"395","article-title":"Pseudo-random generators under uniform assumptions","author":"H\u00e5stad","year":"1990","journal-title":"Proc. 22nd Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(93)90204-M_BIB7","first-page":"12","article-title":"Pseudo-random generation from one-way functions","author":"Impagliazzo","year":"1989","journal-title":"Proc. 21st ACM Symposium on Theory of Computing"},{"key":"10.1016\/0020-0190(93)90204-M_BIB8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0304-3975(86)90081-2","article-title":"On the notion of infinite pseudorandom sequences","volume":"48","author":"Ko","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(93)90204-M_BIB9","first-page":"1","article-title":"Three approaches for defining the concept of information quantity","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0020-0190(93)90204-M_BIB10","first-page":"206","article-title":"Laws of information conservation (non-growth) and aspects of the foundation of probability theory","volume":"10","author":"Levin","year":"1974","journal-title":"Problems Inform. Transmission"},{"issue":"4","key":"10.1016\/0020-0190(93)90204-M_BIB11","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF02579323","article-title":"One-way functions and pseudorandom generators","volume":"7","author":"Levin","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(93)90204-M_BIB12","series-title":"Ph.D. Thesis","article-title":"Resource bounded Kolmogorov complexity, a link between computational complexity and information theory","author":"Longpr\u00e9","year":"1986"},{"key":"10.1016\/0020-0190(93)90204-M_BIB13","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1109\/SCT.1988.5265","article-title":"Two decades of applied Kolmogorov complexity","author":"Li","year":"1988","journal-title":"Proc. 3rd Ann. Conf. on Structure in Complexity Theory"},{"key":"10.1016\/0020-0190(93)90204-M_BIB14_1","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication, Parts I and II","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0020-0190(93)90204-M_BIB14_2","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1002\/j.1538-7305.1948.tb00917.x","article-title":"A mathematical theory of communication, Parts I and II","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0020-0190(93)90204-M_BIB15","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","article-title":"Communication theory of secrecy systems","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0020-0190(93)90204-M_BIB16","first-page":"330","article-title":"A complexity theoretic approach to randomness","author":"Sipser","year":"1983","journal-title":"Proc. 15th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(93)90204-M_BIB17_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","article-title":"A formal theory of inductive inference, Parts 1 and 2","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(93)90204-M_BIB17_2","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","article-title":"A formal theory of inductive inference, Parts 1 and 2","volume":"7","author":"Solomonoff","year":"1964","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(93)90204-M_BIB18","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","article-title":"The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms","volume":"25","author":"Zvonkin","year":"1970","journal-title":"Russ. Math. Surv."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390204M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390204M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:27:05Z","timestamp":1555129625000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390204M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["002001909390204M"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90204-m","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}