{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T21:12:51Z","timestamp":1769721171474,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540648925","type":"print"},{"value":"9783540684626","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055742","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T17:12:36Z","timestamp":1154020356000},"page":"370-389","source":"Crossref","is-referenced-by-count":63,"title":["Building PRFs from PRPs"],"prefix":"10.1007","author":[{"given":"Chris","family":"Hall","sequence":"first","affiliation":[]},{"given":"David","family":"Wagner","sequence":"additional","affiliation":[]},{"given":"John","family":"Kelsey","sequence":"additional","affiliation":[]},{"given":"Bruce","family":"Schneier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"W. Aiello, R. Venkatesan, \u201cFoiling birthday attacks in length doubling transformations,\u201d Advances in Cryptology \u2014 EUROCRYPT '96 Proceedings, Springer-Verlag, pp. 307\u2013320.","DOI":"10.1007\/3-540-68339-9_27"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare, R. Canetti, H. Krawczyk, \u201cPseudorandom Functions Revisited: The Cascade Construction and its Concrete Security,\u201d Proceedings of the 37th Symposium on Foundations of Computer Science, IEEE, 1996.","DOI":"10.1109\/SFCS.1996.548510"},{"key":"27_CR3","unstructured":"M. Bellare, A. Desai, E. Jokipii, P. Rogaway, \u201cA Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation,\u201d Full version, Extended abstract in Proceedings of 38th Annual Symposium on Foundations of Computer Science (FOCS 97), IEEE, 1997."},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare, R. Gu\u00e9rin, P. Rogaway, \u201cXOR MACs: New methods for message authentication using finite pseudorandom functions,\u201d Advances in Cryptology\u2014CRYPTO '95 Proceedings, Springer-Verlag, 1995, pp 15\u201328.","DOI":"10.1007\/3-540-44750-4_2"},{"key":"27_CR5","unstructured":"M. Bellare, J. Kilian, P. Rogaway, \u201cThe security of cipher block chaining,\u201d Advances in Cryptology\u2014CRYPTO '94 Proceedings, Springer-Verlag, 1994."},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"M. Billare, T. Krovetz, P. Rogaway, \u201cLuby-Rackoff Backwards: Increasing Security by Making Block Ciphers Non-Invertible (Extended Abstract),\u201d Advances in Cryptology\u2014EUROCRYPT '98 Proceedings, Springer-Verlag, 1998.","DOI":"10.1007\/BFb0054132"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum, S. Micali, \u201cHow to Generate Cryptographically Strong Sequences of Pseudo-random Bits,\u201d SIAM J. Comput., 13 (Nov. 1984), pp. 850\u2013864.","journal-title":"SIAM J. Comput."},{"key":"27_CR8","unstructured":"D. Coppersmith, \u201cLuby-Rackoff: Four rounds is not enough,\u201d IBM Research Report, RC 20674 (12\/24\/96), Mathematics."},{"issue":"No.4","key":"27_CR9","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, S. Micali, \u201cHow to Construct Random Functions,\u201d Journal of the ACM, Vol. 33, No. 4, October 1986, pp. 792\u2013807.","journal-title":"Journal of the ACM"},{"issue":"No.2","key":"27_CR10","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"M. Luby, C. Rackoff, \u201cHow to Construct Pseudorandom Permutations from Pseudorandom Functions,\u201d SIAM J. Comput., Vol. 17, No. 2, April 1988, pp. 373\u2013386.","journal-title":"SIAM J. Comput."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"M. Luby, Pseudorandomness and Cryptographic Applications, Princeton University Press, 1996.","DOI":"10.1515\/9780691206844"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"S. Lucks, \u201cFaster Ruby-Lackoff Ciphers,\u201d Proceedings of Third Fast Software Encryption Workshop, Springer-Verlag, pp. 189\u2013203.","DOI":"10.1007\/3-540-60865-6_53"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"U.M. Maurer, \u201cA Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generators,\u201d Advances in Cryptology\u2014EUROCRYPT '92 Proceedings, Springer-Verlag, 1992, pp. 239\u2013255.","DOI":"10.1007\/3-540-47555-9_21"},{"key":"27_CR14","first-page":"5658","volume":"27","author":"S.M. Matyas","year":"1985","unstructured":"S.M. Matyas, C.H. Meyeter, J. Oseas, \u201cGenerating strong one-way functions with cryptographic algorithm,\u201d IBM Technical Disclosure Bulletin, 27 (1985), 5658\u20135659.","journal-title":"IBM Technical Disclosure Bulletin"},{"key":"27_CR15","unstructured":"M. Naor, O. Reingold, \u201cOn the construction of pseudo-random permutations: Luby-Rackoff revisited.,\u201d preliminary version, http:\/\/www.wisdom.veizmann.ac.il\/Papers\/trs\/CS96-10\/abstract.html"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"J. Pieprzyk, \u201cHow to Construct Pseudorandom Permutations from Single Pseudorandom Functions,\u201d Advances in Cryptology\u2014EUROCRYPT '90, Springer-Verlag, pp. 140\u2013150.","DOI":"10.1007\/3-540-46877-3_12"},{"key":"27_CR17","volume-title":"Ph. D. Thesis","author":"J. Patarin","year":"1991","unstructured":"J. Patarin, \u201cEtude des g\u0144\u0155ateurs de permutations bas\u00e9s sure le Sch\u00e9ma du D.E.S.,\u201d Ph. D. Thesis, INRIA, Domaine de Voluceau, Le Chesnay, France, 1991."},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"J. Patarin, \u201cNew Results on Pseudorandom Permutation Generators Based on the DES Scheme,\u201d Advances in Cryptology\u2014CRYPTO '91 Proceedings, Springer-Verlag, pp. 301\u2013312.","DOI":"10.1007\/3-540-46766-1_25"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"J. Patarin, \u201cHow to Consruct Pseudorandom and Super Pseudorandom Permutations from One Single Pseudorandom Function,\u201d Advances in Cryptology\u2014EUROCRYPT '92 Proceedings, Springer-Verlag, pp. 256\u2013266.","DOI":"10.1007\/3-540-47555-9_22"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"J. Patarin, \u201cImproved Security Bounds for Pseudorandom Permutations,\u201d Proceedings of the Fourth ACM Conference on Computer and Communications Security, April 1\u20134, 1997, pp. 142\u2013150.","DOI":"10.1145\/266420.266452"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"J. Patarin, \u201cAbout Feistel Schemes with Six (or More) Rounds,\u201d Proceedings of the Fifth Fast Software Encryption Workshop, LNCS 1372, Springer, 1998, pp. 103\u2013121.","DOI":"10.1007\/3-540-69710-1_8"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"B. Preneel, P. van Oorschot, \u201cMDx MAC and building fast MACs from hash functions,\u201d Advances in Cryptology\u2014CRYPTO '95 Proceedings, LNCS 1070, Springer-Verlag, 1996.","DOI":"10.1007\/3-540-44750-4_1"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"B. Sadeghiyan, J. Pieprzyk, \u201cOn Necessary and Sufficient Conditions for the Construction of Super Pseudorandom Permutations,\u201d Advances in Cryptology\u2014ASIACRYPT '91, Springer-Verlag, pp. 194\u2013209.","DOI":"10.1007\/3-540-57332-1_16"},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"B. Sadeghiyan, J. Pieprzyk, \u201cA Construction for Super Pseudorandom Permutations from A Single Pseudorandom Function,\u201d Advances in Cryptology\u2014EUROCRYPT '92, Springer-Verlag, pp. 267\u2013284.","DOI":"10.1007\/3-540-47555-9_23"},{"key":"27_CR25","first-page":"80","volume-title":"Theory and Applications of Trapdoor Functions","author":"A.C. Yao","year":"1982","unstructured":"A.C. Yao, \u201cTheory and Applications of Trapdoor Functions,\u201d Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, IEEE, New York, 1982, pp. 80\u201391."},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":", Y. Zheng, T. Matsumoto, H. Imai, \u201cOn the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypothesis,\u201d Advances in Cryptology\u2014CRYPTO '89 Proceedings, Springer-Verlag, pp. 461\u2013480.","DOI":"10.1007\/0-387-34805-0_42"},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"Y. Zheng, T. Matsumoto, H. Imai, \u201cImpossibility and Optimality Results on Constructing Pseudorandom Permutations,\u201d Advances in Cryptology\u2014EUROCRYPT '89, Springer-Verlag, pp. 412\u2013421.","DOI":"10.1007\/3-540-46885-4_41"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO '98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055742","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T10:37:03Z","timestamp":1587119823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055742"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648925","9783540684626"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/bfb0055742","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}