{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:41:48Z","timestamp":1767339708793},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406747"},{"type":"electronic","value":"9783540451464"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45146-4_30","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T17:51:19Z","timestamp":1277229079000},"page":"513-529","source":"Crossref","is-referenced-by-count":49,"title":["Luby-Rackoff: 7 Rounds Are Enough for 2 n(1\u2009\u2212\u2009\u03b5) Security"],"prefix":"10.1007","author":[{"given":"Jacques","family":"Patarin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/3-540-68339-9_27","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"W. Aiollo","year":"1996","unstructured":"Aiollo, W., Venkatesan, R.: Foiling Birthday Attacks in Length- Doubling Transformations - Benes: A Non-Reversible Alternative to Feistel. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 307\u2013320. Springer, Heidelberg (1996)"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-45760-7_9","volume-title":"Topics in Cryptology - CT-RSA 2002","author":"J. Black","year":"2002","unstructured":"Black, J., Rogaway, P.: Ciphers with Arbitrary Finite Domains. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol.\u00a02271, pp. 114\u2013130. Springer, Heidelberg (2002)"},{"issue":"2","key":"30_CR3","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing\u00a017(2), 373\u2013386 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-47555-9_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"U. Maurer","year":"1993","unstructured":"Maurer, U.: A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 239\u2013255. Springer, Heidelberg (1993)"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-46035-7_8","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"U. Maurer","year":"2002","unstructured":"Maurer, U.: Indistinguishability of Random Systems. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 110\u2013132. Springer, Heidelberg (2002)"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39200-9_34","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"U. Maurer","year":"2003","unstructured":"Maurer, U., Pietrzak, K.: The Security of Many-Round Luby-Rackoff Pseudo- Random Permutations. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, Springer, Heidelberg (2003)"},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/PL00003817","volume":"12","author":"M. Naor","year":"1999","unstructured":"Naor, M., Reingold, O.: On the construction of pseudo-random permutations: Luby-Rackoff revisited. Journal of Cryptology\u00a012, 29\u201366 (1999); Extended abstract was published. In: Proc. 29th Ann. ACM Symp. on Theory of Computing, pp. 189\u2013199 (1997)","journal-title":"Journal of Cryptology"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/3-540-54303-1_131","volume-title":"EUROCODE \u201990","author":"J. Patarin","year":"1991","unstructured":"Patarin, J.: Pseudorandom Permutations based on the DES Scheme. In: Charpin, P., Cohen, G. (eds.) EUROCODE 1990. LNCS, vol.\u00a0514, pp. 193\u2013204. Springer, Heidelberg (1991)"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-46766-1_25","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"J. Patarin","year":"1992","unstructured":"Patarin, J.: New results on pseudorandom permutation generators based on the DES scheme. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 301\u2013312. Springer, Heidelberg (1992)"},{"unstructured":"Patarin, J.: Etude des g\u00e9n\u00e9rateurs de permutations bas\u00e9s sur le sch\u00e9ma du DES. Ph. D. Thesis, Inria, Domaine de Voluceau, Le Chesnay, France (1991)","key":"30_CR10"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-47555-9_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"J. Patarin","year":"1993","unstructured":"Patarin, J.: How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 256\u2013266. Springer, Heidelberg (1993)"},{"doi-asserted-by":"crossref","unstructured":"Patarin, J.: Improved Security Bounds for Pseudorandom Permutations. In: 4th ACM Conference on Computer and Communications Security, April 2-4, Zurich, Switzerland, pp. 142\u2013150 (1997)","key":"30_CR12","DOI":"10.1145\/266420.266452"},{"doi-asserted-by":"crossref","unstructured":"Patarin, J.: About Feistel Schemes with Six (or More) Rounds. In: Fast Software Encryption 1998, pp. 103\u2013121 (1998)","key":"30_CR13","DOI":"10.1007\/3-540-69710-1_8"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45682-1_14","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"J. Patarin","year":"2001","unstructured":"Patarin, J.: Generic Attacks on Feistel Schemes. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 222\u2013238. Springer, Heidelberg (2001)"},{"unstructured":"Patarin, J.: Luby-Rackoff: 7 Rounds are Enough for 2 n(1\u2009\u2212\u2009\u03b5) Security. Extended version of this paper. Available from the author","key":"30_CR15"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-48519-8_13","volume-title":"Fast Software Encryption","author":"S. Patel","year":"1999","unstructured":"Patel, S., Ramzan, Z., Sundaram, G.: Toward making Luby-Rackoff ciphers optimal and practical. In: Knudsen, L.R. (ed.) FSE 1999. LNCS, vol.\u00a01636, p. 171. Springer, Heidelberg (1999)"},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/3-540-46877-3_12","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"J. Pieprzyk","year":"1991","unstructured":"Pieprzyk, J.: How to construct pseudorandom permutations from Single Pseudorandom Functions. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 140\u2013150. Springer, Heidelberg (1991)"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/3-540-44598-6_24","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Z. Ramzan","year":"2000","unstructured":"Ramzan, Z., Reyzin, L.: On the Round Security of Symmetric-Key Cryptographic Primitives. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 376\u2013393. Springer, Heidelberg (2000)"},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-60865-6_49","volume-title":"Fast Software Encryption","author":"B. Schneier","year":"1996","unstructured":"Schneier, B., Kelsey, J.: Unbalanced Feistel Networks and Block Cipher Design. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol.\u00a01039, pp. 121\u2013144. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45146-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T05:51:40Z","timestamp":1559195500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45146-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406747","9783540451464"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45146-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}