{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T19:02:12Z","timestamp":1791399732406,"version":"4.3.3"},"reference-count":13,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1988,4]]},"abstract":"<jats:p>We show how to efficiently construct a pseudorandom invertible permutation generator from a pseudorandom function generator. Goldreich, Goldwasser and Micali [\u201cHow to construct random functions,\u201d Proc. 25th Annual Symposium on Foundations of Computer Science, October 24\u201326, 1984.] introduce the notion of a pseudorandom function generator and show how to efficiently construct a pseudorandom function generator from a pseudorandom bit generator. We use some of the ideas behind the design of the Data Encryption Standard for our construction. A practical implication of our result is that any pseudorandom bit generator can be used to construct a block private key cryptosystem which is secure against chosen plaintext attack, which is one of the strongest known attacks against a cryptosystem.<\/jats:p>","DOI":"10.1137\/0217022","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:30:13Z","timestamp":1109226613000},"page":"373-386","source":"Crossref","is-referenced-by-count":684,"title":["How to Construct Pseudorandom Permutations from Pseudorandom Functions"],"prefix":"10.1137","volume":"17","author":[{"given":"Michael","family":"Luby","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charles","family":"Rackoff","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"RACGS","doi-asserted-by":"publisher","DOI":"10.1137\/0217013"},{"key":"RBA","unstructured":"J. Bamford,  The Puzzle Palace: A Report on America's Most Secret Agency,  1983, Penguin"},{"key":"RBCS","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, B. Chor, A. Shamir,  On the cryptographic security of single RSA bits,  Proceedings of the 15th ACM Symposium on Theory of Computing, Boston,  1983,  421\u2013430","DOI":"10.1145\/800061.808773"},{"key":"RBM","doi-asserted-by":"publisher","DOI":"10.1137\/0213053"},{"key":"RDE","volume-title":"Cryptography and Data Security","author":"Denning D.","year":"1983"},{"key":"RGGM","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Goldwasser, S. Micali,  How to construct random functions,  Proceedings of the 25th Annual Symposium on Foundations of Computer Science,  1984, October 24\u201326 0855.68085","DOI":"10.1109\/SFCS.1984.715949"},{"key":"RGMT","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.100"},{"key":"RH","unstructured":"A. Hodges,  Alan Turing: The Enigma of Intelligence,  1985, Unwin Paperbacks"},{"key":"RLE","doi-asserted-by":"crossref","unstructured":"L. A. Levin,  One-way functions and pseudorandom generators,  Proceedings of the 17th ACM Symposium on Theory of Computing, Providence, RI,  1985,  363\u2013365 0641.68061","DOI":"10.1145\/22145.22185"},{"key":"RLR","unstructured":"M. Luby, C. Rackoff,  Pseudorandom permutation generator and cryptographic composition,  Proc. 18th Annual Symposium on Theory of Computing,  1986, May 28\u201330"},{"key":"RRA","unstructured":"C. Rackoff,  Class Notes on Cryptography, Department of Computer Science, University of Toronto, Toronto, Ontario, Canada,  1985"},{"key":"RVV","doi-asserted-by":"crossref","unstructured":"U. V. Vazirani, V. V. Vazirani,  Efficient and secure pseudo-random number generation,  Proceedings of the 25th IEEE Symposium on Foundations of Computer Science,  1984,  458\u2013463","DOI":"10.1109\/SFCS.1984.715948"},{"key":"RYAO","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\/0217022","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:48:17Z","timestamp":1787338097000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0217022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,4]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,4]]}},"alternative-id":["10.1137\/0217022"],"URL":"https:\/\/doi.org\/10.1137\/0217022","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,4]]}}}