{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:02Z","timestamp":1737497402466,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662266"},{"type":"electronic","value":"9783540485193"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48519-8_13","type":"book-chapter","created":{"date-parts":[[2007,10,24]],"date-time":"2007-10-24T21:34:55Z","timestamp":1193261695000},"page":"171-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Towards Making Luby-Rackoff Ciphers Optimal and Practical"],"prefix":"10.1007","author":[{"given":"Sarvar","family":"Patel","sequence":"first","affiliation":[]},{"given":"Zulfikar","family":"Ramzan","sequence":"additional","affiliation":[]},{"given":"Ganapathy S.","family":"Sundaram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,5,18]]},"reference":[{"key":"13_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/3-540-68339-9_27","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 96","author":"W. Aiello","year":"1996","unstructured":"W. Aiello, R. Venkatesan, Foiling birthday attacks in length-doubling transformations, Advances in Cryptology-EUROCRYPT\u2019 96, LNCS 1070, 307\u2013320, 1996."},{"key":"13_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/3-540-60865-6_48","volume-title":"BEAR and LION, Fast Software Encryption","author":"R. Anderson","year":"1996","unstructured":"R. Anderson, E. Biham, Two practical and provably secure block ciphers, BEAR and LION, Fast Software Encryption, LNCS 1039, 113\u2013120, 1996."},{"key":"13_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology","author":"M. Bellare","year":"1996","unstructured":"M. Bellare, R. Canetti, H. Krawczyk, Keying hash functions for message authentication, Advances in Cryptology, LNCS 1109, 1996."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare, R. Canetti, H. Krawczyk. HMAC: Keyed-Hashing for Message Authentication, Internet RFC, 2104, February 1997.","DOI":"10.1007\/3-540-68697-5_1"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, and A. Micali, How to construct random functions?, Journal of ACM, 33: 792\u2013807, 1986.","journal-title":"Journal of ACM"},{"key":"13_CR6","unstructured":"P. Gutmann, documentation to SFS release 1.20-SFS7.DOC, URL: http:\/\/www.cs.auckland.ac.nz\/pgut01\/sfs.html , 1995."},{"issue":"#2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"M. Luby, and C. Rackoff, How to construct pseudorandom permutations from pseudorandom functions, SIAM Journal of Computing, 17: #2, 373\u2013386, 1988.","journal-title":"SIAM Journal of Computing"},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/3-540-60865-6_53","volume":"1039","author":"S. Lucks","year":"1996","unstructured":"S. Lucks, Faster Luby-Rackoff ciphers, Proc. Fast Software Encryption, LNCS, 1039, 189\u2013203, 1996.","journal-title":"Proc. Fast Software Encryption, LNCS"},{"key":"13_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-47555-9_21","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 92","author":"U. Maurer","year":"1992","unstructured":"U. Maurer, A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators, Advances in Cryptology-EUROCRYPT\u2019 92, LNCS 658, 239\u2013255, 1992."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/PL00003817","volume":"12","author":"M. Naor","year":"1999","unstructured":"M. Naor, O. Reingold, On the construction of pseudo-random permutations: Luby-Rackoff revisited, J. of Cryptology, Vol. 12, 29\u201366, 1999. Preliminary version in: Proc. 29th Annual ACM STOC, 189\u2013199, 1997.","journal-title":"J. of Cryptology"},{"key":"13_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BFb0055734","volume-title":"A simple construction of pseudo-random functions from MACs, Advances in Cryptology-CRYPTO\u2019 98","author":"M. Naor","year":"1998","unstructured":"M. Naor, O. Reingold, >From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs, Advances in Cryptology-CRYPTO\u2019 98, LNCS, 267\u2013282, 1998."},{"key":"13_CR12","series-title":"Lect Notes Comput Sci","first-page":"301","volume-title":"Advances in Cryptology-CRYPTO\u2019 91","author":"J. Patarin","year":"1991","unstructured":"J. Patarin, New results on pseudorandom permutation generators based on the DES scheme, Advances in Cryptology-CRYPTO\u2019 91, LNCS, 301\u2013312, 1991."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"J. Patarin, Improved security bounds for pseudorandom permutations, 4th ACM Conference on Computer and Communications Security, 142\u2013150, 1997.","DOI":"10.1145\/266420.266452"},{"key":"13_CR14","unstructured":"S. Patel, Z. Ramzan, Square hash: Fast message authentication via optimized universal hash functions, preprint."},{"key":"13_CR15","unstructured":"S. Patel, Z. Ramzan, G. S. Sundaram, On constructing pseudorandom generators based on cryptographic hash functions, In preparation."},{"key":"13_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/3-540-46877-3_12","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 90","author":"J. Pieprzyk","year":"1991","unstructured":"J. Pieprzyk, How to construct pseudorandom permutations from single pseudorandom functions, Advances in Cryptology-EUROCRYPT\u2019 90, LNCS 473, 140\u2013150, 1991."},{"key":"13_CR17","unstructured":"U. S. Department of Commerce\/ N. I. S. T, Secure Hash Algorithm, FIPS 180, April 1995."}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48519-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T21:40:37Z","timestamp":1737495637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48519-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662266","9783540485193"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-48519-8_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"18 May 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}