{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:01:11Z","timestamp":1743127271510,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540887324"},{"type":"electronic","value":"9783540887331"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88733-1_2","type":"book-chapter","created":{"date-parts":[[2008,10,16]],"date-time":"2008-10-16T22:08:02Z","timestamp":1224194882000},"page":"22-37","source":"Crossref","is-referenced-by-count":18,"title":["Tweakable Pseudorandom Permutation from Generalized Feistel Structure"],"prefix":"10.1007","author":[{"given":"Atsushi","family":"Mitsuda","sequence":"first","affiliation":[]},{"given":"Tetsu","family":"Iwata","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/3-540-39200-9_31","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"M. Bellare","year":"2003","unstructured":"Bellare, M., Kohno, T.: A theoretical treatment of related-key attacks: RKA-PRPs, RKA-PRFs, and applications. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 491\u2013506. Springer, Heidelberg (2003)"},{"key":"2_CR2","first-page":"265","volume":"18","author":"J.L. Carter","year":"1979","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. JCSS\u00a018, 265\u2013278 (1979)","journal-title":"JCSS"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/11941378_21","volume-title":"Progress in Cryptology - INDOCRYPT 2006","author":"D. Chakraborty","year":"2006","unstructured":"Chakraborty, D., Sarkar, P.: HCH: A new tweakable enciphering scheme using the hash-encrypt-hash approach. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol.\u00a04329, pp. 287\u2013302. Springer, Heidelberg (2006)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/11799313_19","volume-title":"Fast Software Encryption","author":"D. Chakraborty","year":"2006","unstructured":"Chakraborty, D., Sarkar, P.: A new mode of encryption providing a tweakable strong pseudo-random permutation. In: Robshaw, M. (ed.) FSE 2006. LNCS, vol.\u00a04047, pp. 293\u2013309. Springer, Heidelberg (2006)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-44706-7_4","volume-title":"Fast Software Encryption","author":"P. Crowley","year":"2001","unstructured":"Crowley, P.: Mercy: A fast large block cipher for disk sector encryption. In: Schneier, B. (ed.) FSE 2000. LNCS, vol.\u00a01978, pp. 49\u201363. Springer, Heidelberg (2001)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-76900-2_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"D. Goldenberg","year":"2007","unstructured":"Goldenberg, D., Hohenberger, S., Liskov, M., Schwartz, E.C., Seyalioglu, H.: On tweaking Luby-Rackoff blockciphers. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 342\u2013356. Springer, Heidelberg (2007)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Feistel, H.: Cryptography and computer privacy. Scientific American, 15\u201323 (1973)","DOI":"10.1038\/scientificamerican0573-15"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","first-page":"21","volume-title":"Fast Software Encryption","author":"S.R. Fluhrer","year":"2002","unstructured":"Fluhrer, S.R.: Cryptanalysis of the Mercy block cipher. In: Matsui, M. (ed.) FSE 2001. LNCS, vol.\u00a02355, pp. 21\u201340. Springer, Heidelberg (2002)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-30556-9_25","volume-title":"Progress in Cryptology - INDOCRYPT 2004","author":"S. Halevi","year":"2004","unstructured":"Halevi, S.: EME\u2009\u2217\u2009: Extending EME to handle arbitrary-length messages with associated data. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol.\u00a03348, pp. 315\u2013327. Springer, Heidelberg (2004)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-540-74143-5_23","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"S. Halevi","year":"2007","unstructured":"Halevi, S.: Invertible universal hashing and the TET encryption mode. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 412\u2013429. Springer, Heidelberg (2007)"},{"key":"2_CR11","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":"2_CR12","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":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-48000-6_4","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"C. D\u2019Halluin","year":"1999","unstructured":"D\u2019Halluin, C., Bijnens, G., Preneel, B., Rijmen, V.: Equivalent keys of HPC. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 29\u201342. Springer, Heidelberg (1999)"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/11894063_4","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"D. Hong","year":"2006","unstructured":"Hong, D., Sung, J., Hong, S., Lim, J., Lee, S., Koo, B.S., Lee, C., Chang, D., Lee, J., Jeong, K., Kim, H., Kim, J., Chee, S.: HIGHT: A new block cipher suitable for low-resource device. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol.\u00a04249, pp. 46\u201359. Springer, Heidelberg (2006)"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-45708-9_3","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"M. Liskov","year":"2002","unstructured":"Liskov, M., Rivest, R., Wagner, D.: Tweakable block ciphers. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 31\u201346. Springer, Heidelberg (2002)"},{"issue":"2","key":"2_CR16","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.\u00a0on Computing\u00a017(2), 373\u2013386 (1988)","journal-title":"SIAM J.\u00a0on Computing"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-74462-7_8","volume-title":"Selected Areas in Cryptography","author":"K. Minematsu","year":"2007","unstructured":"Minematsu, K.: Improved security analysis of XEX and LRW modes. In: Biham, E., Youssef, A.M. (eds.) SAC 2006. LNCS, vol.\u00a04356, pp. 96\u2013113. Springer, Heidelberg (2007)"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-540-77026-8_19","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"K. Minematsu","year":"2007","unstructured":"Minematsu, K., Matsushima, T.: Tweakable enciphering schemes from hash-sum-expansion. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol.\u00a04859, pp. 252\u2013267. Springer, Heidelberg (2007)"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-44448-3_22","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"S. Moriai","year":"2000","unstructured":"Moriai, S., Vaudenay, S.: On the pseudorandomness of top-level schemes of block ciphers. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 289\u2013302. Springer, Heidelberg (2000)"},{"issue":"1","key":"2_CR20","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 revisited. J.\u00a0Cryptology\u00a012(1), 29\u201366 (1999)","journal-title":"J.\u00a0Cryptology"},{"key":"2_CR21","unstructured":"Rivest, R.L., Robshaw, M.J.B., Sidney, R., Yin, Y.L.: The RC6 block cipher. Submission to AES (1998), \n                    \n                      http:\/\/www.rsa.com\/"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-30539-2_2","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"P. Rogaway","year":"2004","unstructured":"Rogaway, P.: Efficient instantiations of tweakable blockciphers and refinements to mode OCB and PMAC. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 16\u201331. Springer, Heidelberg (2004)"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-76788-6_15","volume-title":"Information Security and Cryptology - ICISC 2007","author":"P. Sarkar","year":"2007","unstructured":"Sarkar, P.: Improving upon the TET mode of operation. In: Nam, K.-H., Rhee, G. (eds.) ICISC 2007. LNCS, vol.\u00a04817, pp. 180\u2013192. Springer, Heidelberg (2007)"},{"key":"2_CR24","unstructured":"Schroeppel, R.: The Hasty Pudding Cipher. NIST AES proposal (1998), \n                    \n                      http:\/\/www.cs.arizona.edu\/~rcs\/hpc"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-74619-5_12","volume-title":"Fast Software Encryption","author":"T. Shirai","year":"2007","unstructured":"Shirai, T., Shibutani, K., Akishita, T., Moriai, S., Iwata, T.: The 128-bit blockcipher CLEFIA. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol.\u00a04593, pp. 181\u2013195. Springer, Heidelberg (2007)"},{"key":"2_CR26","unstructured":"Wagner, D.: Equivalent keys in HPC. Presentation at the rump session of AES2, Rome (1999)"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/11599548_15","volume-title":"Information Security and Cryptology","author":"P. Wang","year":"2005","unstructured":"Wang, P., Feng, D., Wu, W.: HCTR: A variable-input-length enciphering mode. In: Feng, D., Lin, D., Yung, M. (eds.) CISC 2005. LNCS, vol.\u00a03822, pp. 175\u2013188. Springer, Heidelberg (2005)"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/0-387-34805-0_42","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"Y. Zheng","year":"1990","unstructured":"Zheng, Y., Matsumoto, T., Imai, H.: On the construction of block ciphers provably secure and not relying on any unproved hypotheses. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 461\u2013480. Springer, Heidelberg (1990)"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88733-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T14:35:18Z","timestamp":1551623718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88733-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540887324","9783540887331"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88733-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}