{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:35:34Z","timestamp":1725564934556},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223795"},{"type":"electronic","value":"9783540278009"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27800-9_20","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:00:38Z","timestamp":1283727638000},"page":"224-235","source":"Crossref","is-referenced-by-count":2,"title":["How to Re-use Round Function in Super-Pseudorandom Permutation"],"prefix":"10.1007","author":[{"given":"Tetsu","family":"Iwata","sequence":"first","affiliation":[]},{"given":"Kaoru","family":"Kurosawa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"20_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J.L. Carter","year":"1979","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci.\u00a018(2), 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-45473-X_21","volume-title":"Fast Software Encryption","author":"H. Gilbert","year":"2002","unstructured":"Gilbert, H., Minier, M.: New results on the pseudorandomness of some block cipher constructions. In: Matsui, M. (ed.) FSE 2001. LNCS, vol.\u00a02355, pp. 248\u2013266. Springer, Heidelberg (2002)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-45146-4_28","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"S. Halevi","year":"2003","unstructured":"Halevi, S., Rogaway, P.: A tweakable enciphering mode. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 482\u2013499. Springer, Heidelberg (2003)"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-24660-2_23","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"S. Halevi","year":"2004","unstructured":"Halevi, S., Rogaway, P.: A parallelizable enciphering mode. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol.\u00a02964, pp. 292\u2013304. Springer, Heidelberg (2004)"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/3-540-36552-4_16","volume-title":"Information Security and Cryptology - ICISC 2002","author":"T. Iwata","year":"2003","unstructured":"Iwata, T., Kurosawa, K.: On the universal hash functions in Luby-Rackoff cipher. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 226\u2013236. Springer, Heidelberg (2003)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Iwata, T., Kurosawa, K.: How to re-use round function in super-pseudorandom permutation. A full version of this paper. Available from the author (2004)","DOI":"10.1007\/978-3-540-27800-9_20"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-45661-9_12","volume-title":"Fast Software Encryption","author":"T. Iwata","year":"2002","unstructured":"Iwata, T., Yoshino, T., Kurosawa, K.: Non-cryptographic primitive for pseudorandom permutation. In: Daemen, J., Rijmen, V. (eds.) FSE 2002. LNCS, vol.\u00a02365, pp. 149\u2013163. Springer, Heidelberg (2002)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-45473-X_20","volume-title":"Fast Software Encryption","author":"T. Iwata","year":"2002","unstructured":"Iwata, T., Yoshino, T., Yuasa, T., Kurosawa, K.: Round security and superpseudorandomness of MISTY type structure. In: Matsui, M. (ed.) FSE 2001. LNCS, vol.\u00a02355, pp. 233\u2013247. Springer, Heidelberg (2002)"},{"issue":"2","key":"20_CR9","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 J. Comput.\u00a017(2), 373\u2013386 (1988)","journal-title":"SIAM J. Comput."},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/3-540-60865-6_53","volume-title":"Fast Software Encryption","author":"S. Lucks","year":"1996","unstructured":"Lucks, S.: Faster Luby-Rackoff ciphers. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol.\u00a01039, pp. 189\u2013203. Springer, Heidelberg (1996)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","first-page":"206","volume-title":"Fast Software Encryption","author":"M. Matsui","year":"1996","unstructured":"Matsui, M.: New structure of block ciphers with provable security against differential and linear cryptanalysis. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol.\u00a01039, pp. 206\u2013218. Springer, Heidelberg (1996)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/BFb0052334","volume-title":"Fast Software Encryption","author":"M. Matsui","year":"1997","unstructured":"Matsui, M.: New block encryption algorithm MISTY. In: Biham, E. (ed.) FSE 1997. LNCS, vol.\u00a01267, pp. 54\u201368. Springer, Heidelberg (1997)"},{"key":"20_CR13","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.M. Maurer","year":"2002","unstructured":"Maurer, U.M.: Indistinguishability of random systems. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 110\u2013132. Springer, Heidelberg (2002)"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/3-540-39200-9_34","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"U.M. Maurer","year":"2003","unstructured":"Maurer, U.M., Pietrzak, K.: The security of many-round Luby-Rackoff pseudorandom permutations. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 544\u2013561. Springer, Heidelberg (2003)"},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/PL00003817","volume":"12","author":"M. Naor","year":"1999","unstructured":"Naor, M., Reingold, O.: On the construction of pseudorandom permutations: Luby-Rackoff revised. J. Cryptology\u00a012(1), 29\u201366 (1999)","journal-title":"J. Cryptology"},{"key":"20_CR16","volume-title":"A pseudo-random encryption mode","author":"M. Naor","year":"2002","unstructured":"Naor, M., Reingold, O.: A pseudo-random encryption mode. IEEE Computer Society, Los Alamitos (2002); Security in Storage Working Group (SISWG), Available at http:\/\/siswg.org\/"},{"key":"20_CR17","unstructured":"Ohnishi, Y.: A study on data security. Master\u2019s Thesis (in Japanese), Tohoku University (1988)"},{"key":"20_CR18","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":"20_CR19","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 of pseudorandom permutation generators based on the DES scheme. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 301\u2013312. Springer, Heidelberg (1992)"},{"key":"20_CR20","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)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Patarin, J.: Improved security bounds for pseudorandom permutations. In: Proceedings of 4-th ACM Conference on Computer and Communications Security, ACM CCS 1997, pp. 142\u2013150 (1997)","DOI":"10.1145\/266420.266452"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-69710-1_8","volume-title":"Fast Software Encryption","author":"J. Patarin","year":"1998","unstructured":"Patarin, J.: About Feistel schemes with six (or more) rounds. In: Vaudenay, S. (ed.) FSE 1998. LNCS, vol.\u00a01372, pp. 103\u2013121. Springer, Heidelberg (1998)"},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-540-45146-4_30","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Patarin","year":"2003","unstructured":"Patarin, J.: Luby-Rackoff: 7 rounds are enough for 2n(1\u2212\u2009\u03b5) security. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 513\u2013529. Springer, Heidelberg (2003)"},{"key":"20_CR24","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.: Towards making Luby-Rackoff ciphers optimal and practical. In: Knudsen, L.R. (ed.) FSE 1999. LNCS, vol.\u00a01636, pp. 171\u2013185. Springer, Heidelberg (1999)"},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-36492-7_18","volume-title":"Selected Areas in Cryptography","author":"S. Patel","year":"2003","unstructured":"Patel, S., Ramzan, Z., Sundaram, G.: Luby-Rackoff ciphers: Why XOR is not so exclusive. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol.\u00a02595, pp. 271\u2013290. Springer, Heidelberg (2003)"},{"key":"20_CR26","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":"20_CR27","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":"20_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/3-540-46885-4_42","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"R.A. Rueppel","year":"1990","unstructured":"Rueppel, R.A.: On the security of Schnorr\u2019s pseudorandom generator. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 423\u2013428. Springer, Heidelberg (1990)"},{"key":"20_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/3-540-57332-1_16","volume-title":"Advances in Cryptology - ASIACRYPT \u201991","author":"B. Sadeghiyan","year":"1993","unstructured":"Sadeghiyan, B., Pieprezyk, J.: On necessary and sufficient conditions for the construction of super pseudorandom permutations. In: Matsumoto, T., Imai, H., Rivest, R.L. (eds.) ASIACRYPT 1991. LNCS, vol.\u00a0739, pp. 194\u2013209. Springer, Heidelberg (1993)"},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/3-540-47555-9_23","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"B. Sadeghiyan","year":"1993","unstructured":"Sadeghiyan, B., Pieprezyk, J.: A construction of super pseudorandom permutations from a single pseudorandom function. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 267\u2013284. Springer, Heidelberg (1993)"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/3-540-45961-8_19","volume-title":"Advances in Cryptology - EUROCRYPT \u201988","author":"C.P. Schnorr","year":"1988","unstructured":"Schnorr, C.P.: On the construction of random number generators and random function generators. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol.\u00a0330, pp. 225\u2013232. Springer, Heidelberg (1988)"},{"key":"20_CR32","series-title":"Lecture Notes in Computer Science","first-page":"9","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"S. Vaudenay","year":"1999","unstructured":"Vaudenay, S.: On the Lai-Massey scheme. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 9\u201319. Springer, Heidelberg (1999)"},{"issue":"4","key":"20_CR33","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00145-003-0220-6","volume":"16","author":"S. Vaudenay","year":"2003","unstructured":"Vaudenay, S.: Decorrelation: A theory for block cipher security. J. Cryptology\u00a016(4), 249\u2013286 (2003)","journal-title":"J. Cryptology"},{"issue":"3","key":"20_CR34","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M.N. Wegman","year":"1981","unstructured":"Wegman, M.N., Carter, J.L.: New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci.\u00a022(3), 265\u2013279 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1007\/3-540-46885-4_41","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"Y. Zheng","year":"1990","unstructured":"Zheng, Y., Matsumoto, T., Imai, H.: Impossibility and optimality results on constructing pseudorandom permutations. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 412\u2013422. Springer, Heidelberg (1990)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27800-9_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:17Z","timestamp":1605759677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27800-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223795","9783540278009"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27800-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}