{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:00:47Z","timestamp":1725512447066},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540243274"},{"type":"electronic","value":"9783540305644"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30564-4_18","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T10:39:26Z","timestamp":1268044766000},"page":"252-266","source":"Crossref","is-referenced-by-count":18,"title":["Collision Attack and Pseudorandomness of Reduced-Round Camellia"],"prefix":"10.1007","author":[{"given":"Wu","family":"Wenling","sequence":"first","affiliation":[]},{"given":"Feng","family":"Dengguo","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Hua","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","first-page":"183","volume-title":"SAC 2000","author":"K. Aoki","year":"2000","unstructured":"Aoki, K., Ichikawa, T., Kanda, M., Matsui, M., Moriai, S., Nakajima, J., Tokita, T.: Specification of Camellia-a 128-bit Block Cipher. In: SAC 2000, pp. 183\u2013191. Springer, Heidelberg (2000)"},{"key":"18_CR2","unstructured":"http:\/\/www.cryptonessie.org"},{"key":"18_CR3","unstructured":"Kawabata, T., Kaneko, T.: A study on higher order differential attack of Camellia. In: Proceedings of the 2nd NESSIE workshop (2001)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-36492-7_10","volume-title":"Selected Areas in Cryptography","author":"Y. Hatano","year":"2003","unstructured":"Hatano, Y., Sekine, H., Kaneko, T.: Higher order differential attack of Camellia(II). In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol.\u00a02595, pp. 39\u201356. Springer, Heidelberg (2003)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/3-540-45861-1_3","volume-title":"Information Security and Cryptology - ICISC 2001","author":"S. Lee","year":"2002","unstructured":"Lee, S., Hong, S., Lee, S., Lim, J., Yoon, S.: Truncated Differential Cryptanalysis of Camellia. In: Kim, K.-c. (ed.) ICISC 2001. LNCS, vol.\u00a02288, pp. 32\u201338. Springer, Heidelberg (2002)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-45682-1_12","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"M. Sugita","year":"2001","unstructured":"Sugita, M., Kobara, K., Imai, H.: Security of reduced version of the block cipher Camellia against truncated and impossible differential cryptanalysis. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 193\u2013207. Springer, Heidelberg (2001)"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/3-540-45661-9_10","volume-title":"Fast Software Encryption","author":"T. Shirai","year":"2002","unstructured":"Shirai, T., Kanamaru, S., Abe, G.: Improved upper bounds of differential and linear characteristic probability for Camellia. In: Daemen, J., Rijmen, V. (eds.) FSE 2002. LNCS, vol.\u00a02365, pp. 128\u2013142. Springer, Heidelberg (2002)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/3-540-45600-7_27","volume-title":"Information and Communications Security","author":"H. Ye-ping","year":"2001","unstructured":"Ye-ping, H., Si-han, Q.: Square attack on Reduced Camellia Cipher. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol.\u00a02229, pp. 238\u2013245. Springer, Heidelberg (2001)"},{"key":"18_CR9","series-title":"Lecture Notes in Artificial Intelligence","first-page":"89","volume-title":"WEBKDD 2001 - Mining Web Log Data Across All Customers Touch Points","author":"Y. Yeom","year":"2002","unstructured":"Yeom, Y., Park, S., Kim, I.: On the security of Camellia against the square attack. In: Kohavi, R., Masand, B., Spiliopoulou, M., Srivastava, J. (eds.) WebKDD 2001. LNCS (LNAI), vol.\u00a02356, pp. 89\u201399. Springer, Heidelberg (2002)"},{"key":"18_CR10","unstructured":"Yeom, Y., Park, I., Kim, I.: A study of Integral type cryptanalysis on Camellia. In: The 2003 Symposium on Cryptography and Information Security-SCIS 2003 (2003)"},{"issue":"2","key":"18_CR11","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":"18_CR12","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)"},{"key":"18_CR13","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.M. Maurer","year":"1993","unstructured":"Maurer, U.M.: 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":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BFb0028566","volume-title":"STACS 98","author":"S. Vaudenay","year":"1998","unstructured":"Vaudenay, S.: Provable security for block ciphers by decorrelation. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 249\u2013275. Springer, Heidelberg (1998)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-44706-7_16","volume-title":"Fast Software Encryption","author":"T. Iwata","year":"2001","unstructured":"Iwata, T., Kurosawa, K.: On the Pseudorandomness of the AES Finalists-RC6 and Serpent. In: Schneier, B. (ed.) FSE 2000. LNCS, vol.\u00a01978, pp. 231\u2013243. Springer, Heidelberg (2001)"},{"issue":"1","key":"18_CR16","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. Journal of Cryptology\u00a012(1), 29\u201366 (1999)","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30564-4_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:30:13Z","timestamp":1619998213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30564-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540243274","9783540305644"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30564-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}