{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:38:59Z","timestamp":1765960739902},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642340468"},{"type":"electronic","value":"9783642340475"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-34047-5_3","type":"book-chapter","created":{"date-parts":[[2012,9,10]],"date-time":"2012-09-10T10:56:19Z","timestamp":1347274579000},"page":"29-48","source":"Crossref","is-referenced-by-count":61,"title":["Zero Correlation Linear Cryptanalysis with Reduced Data Complexity"],"prefix":"10.1007","author":[{"given":"Andrey","family":"Bogdanov","sequence":"first","affiliation":[]},{"given":"Meiqin","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/3-540-48910-X_2","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"E. Biham","year":"1999","unstructured":"Biham, E., Biryukov, A., Shamir, A.: Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 12\u201323. Springer, Heidelberg (1999)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/11605805_2","volume-title":"Topics in Cryptology \u2013 CT-RSA 2006","author":"E. Biham","year":"2006","unstructured":"Biham, E., Dunkelman, O., Keller, N.: Related-Key Impossible Differential Attacks on 8-Round AES-192. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol.\u00a03860, pp. 21\u201333. Springer, Heidelberg (2006)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-38424-3_1","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"E. Biham","year":"1991","unstructured":"Biham, E., Shamir, A.: Differential Cryptanalysis of DES-like Cryptosystems. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 2\u201321. Springer, Heidelberg (1991)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/978-3-642-25385-0_19","volume-title":"ASIACRYPT 11","author":"A. Bogdanov","year":"2011","unstructured":"Bogdanov, A., Khovratovich, D., Rechberger, C.: Biclique Cryptanalysis of the Full AES. In: Lee, D.H. (ed.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 344\u2013371. Springer, Heidelberg (2011)"},{"key":"3_CR5","unstructured":"Bogdanov, A., Rijmen, V.: Zero Correlation Linear Cryptanalysis of Block Ciphers. IACR Eprint Archive Report 2011\/123 (March 2011)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Bogdanov, A., Wang, M.: Zero Correlation Linear Cryptanalysis with Reduced Data Complexity. IACR Eprint Archive Report (2012)","DOI":"10.1007\/978-3-642-34047-5_3"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-69053-0_1","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"J. Borst","year":"1997","unstructured":"Borst, J., Knudsen, L.R., Rijmen, V.: Two Attacks on Reduced IDEA. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 1\u201313. Springer, Heidelberg (1997)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-642-13858-4_20","volume-title":"Fast Software Encryption","author":"C. Bouillaguet","year":"2010","unstructured":"Bouillaguet, C., Dunkelman, O., Leurent, G., Fouque, P.-A.: Another Look at Complementation Properties. In: Hong, S., Iwata, T. (eds.) FSE 2010. LNCS, vol.\u00a06147, pp. 347\u2013364. Springer, Heidelberg (2010)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Chen, J., Wang, M., Preneel, B.: Impossible Differential Cryptanalysis of Lightweight Block Ciphers TEA, XTEA and HIGHT. IACR Eprint Archive Report 2011\/616 (2011)","DOI":"10.1007\/978-3-642-31410-0_8"},{"key":"3_CR10","unstructured":"Collard, B., Standaert, F.-X.: Experimenting Linear Cryptanalysis. In: Junod, P., Canteaut, A. (eds.) Advanced Linear Cryptanalysis of Block and Stream Ciphers. Cryptology and Information Security Series, vol.\u00a07. IOS Press (2011)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-540-76788-6_7","volume-title":"Information Security and Cryptology - ICISC 2007","author":"B. Collard","year":"2007","unstructured":"Collard, B., Standaert, F.-X., Quisquater, J.-J.: Improving the Time Complexity of Matsui\u2019s Linear Cryptanalysis. In: Nam, K.-H., Rhee, G. (eds.) ICISC 2007. LNCS, vol.\u00a04817, pp. 77\u201388. Springer, Heidelberg (2007)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-60590-8_21","volume-title":"Fast Software Encryption","author":"J. Daemen","year":"1995","unstructured":"Daemen, J., Govaerts, R., Vandewalle, J.: Correlation Matrices. In: Preneel, B. (ed.) FSE 1994. LNCS, vol.\u00a01008, pp. 275\u2013285. Springer, Heidelberg (1995)"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1515\/JMC.2007.011","volume":"1","author":"J. Daemen","year":"2007","unstructured":"Daemen, J., Rijmen, V.: Probability distributions of correlations and differentials in block ciphers. Journal on Mathematical Cryptology\u00a01(3), 221\u2013242 (2007)","journal-title":"Journal on Mathematical Cryptology"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael: AES \u2013 The Advanced Encryption Standard. Springer (2002)","DOI":"10.1007\/978-3-662-04722-4"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-540-71039-4_7","volume-title":"Fast Software Encryption","author":"H. Demirci","year":"2008","unstructured":"Demirci, H., Sel\u00e7uk, A.A.: A Meet-in-the-Middle Attack on 8-Round AES. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol.\u00a05086, pp. 116\u2013126. Springer, Heidelberg (2008)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-540-89255-7_27","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"O. Dunkelman","year":"2008","unstructured":"Dunkelman, O., Keller, N.: An Improved Impossible Differential Attack on MISTY1. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.\u00a05350, pp. 441\u2013454. Springer, Heidelberg (2008)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-14081-5_5","volume-title":"Information Security and Privacy","author":"J. Etrog","year":"2010","unstructured":"Etrog, J., Robshaw, M.J.B.: On Unbiased Linear Approximations. In: Steinfeld, R., Hawkes, P. (eds.) ACISP 2010. LNCS, vol.\u00a06168, pp. 74\u201386. Springer, Heidelberg (2010)"},{"key":"3_CR18","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications, vol. 1. Wiley & Sons (1968)"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-17373-8_10","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"O. Dunkelman","year":"2010","unstructured":"Dunkelman, O., Keller, N., Shamir, A.: Improved Single-Key Attacks on 8-Round AES-192 and AES-256. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol.\u00a06477, pp. 158\u2013176. Springer, Heidelberg (2010)"},{"key":"3_CR20","unstructured":"Hoel, P., Port, S., Stone, C.: Introduction to Probability Theory. Brooks Cole (1972)"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-540-24691-6_30","volume-title":"Information Security and Cryptology - ICISC 2003","author":"S. Hong","year":"2004","unstructured":"Hong, S., Hong, D., Ko, Y., Chang, D., Lee, W., Lee, S.: Differential Cryptanalysis of TEA and XTEA. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol.\u00a02971, pp. 402\u2013417. Springer, Heidelberg (2004)"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-45537-X_16","volume-title":"Selected Areas in Cryptography","author":"P. Junod","year":"2001","unstructured":"Junod, P.: On the Complexity of Matsui\u2019s Attack. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol.\u00a02259, pp. 199\u2013211. Springer, Heidelberg (2001)"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-89754-5_28","volume-title":"Progress in Cryptology - INDOCRYPT 2008","author":"J.-P. Kaps","year":"2008","unstructured":"Kaps, J.-P.: Chai-Tea, Cryptographic Hardware Implementations of xTEA. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol.\u00a05365, pp. 363\u2013375. Springer, Heidelberg (2008)"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/3-540-68697-5_19","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"J. Kelsey","year":"1996","unstructured":"Kelsey, J., Schneier, B., Wagner, D.: Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 237\u2013251. Springer, Heidelberg (1996)"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BFb0028479","volume-title":"Information and Communications Security","author":"J. Kelsey","year":"1997","unstructured":"Kelsey, J., Schneier, B., Wagner, D.: Related-key Cryptanalysis of 3-WAY, Biham-DES,CAST, DES-X, NewDES, RC2, and TEA. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol.\u00a01334, pp. 233\u2013246. Springer, Heidelberg (1997)"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/11958239_19","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"E. Lee","year":"2006","unstructured":"Lee, E., Hong, D., Chang, D., Hong, S., Lim, J.: A Weak Key Class of XTEA for a Related-Key Rectangle Attack. In: Nguy\u00ean, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol.\u00a04341, pp. 286\u2013297. Springer, Heidelberg (2006)"},{"issue":"1","key":"3_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10207-008-0059-9","volume":"8","author":"J. Lu","year":"2009","unstructured":"Lu, J.: Related-key rectangle attack on 36 rounds of the XTEA block cipher. International Journal of Information Security\u00a08(1), 1\u201311 (2009)","journal-title":"International Journal of Information Security"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-540-79263-5_24","volume-title":"Topics in Cryptology \u2013 CT-RSA 2008","author":"J. Lu","year":"2008","unstructured":"Lu, J., Kim, J.-S., Keller, N., Dunkelman, O.: Improving the Efficiency of Impossible Differential Cryptanalysis of Reduced Camellia and MISTY1. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol.\u00a04964, pp. 370\u2013386. Springer, Heidelberg (2008)"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-89754-5_22","volume-title":"Progress in Cryptology - INDOCRYPT 2008","author":"J. Lu","year":"2008","unstructured":"Lu, J., Dunkelman, O., Keller, N., Kim, J.: New Impossible Differential Attacks on AES. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol.\u00a05365, pp. 279\u2013293. Springer, Heidelberg (2008)"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-642-17401-8_20","volume-title":"Progress in Cryptology - INDOCRYPT 2010","author":"H. Mala","year":"2010","unstructured":"Mala, H., Dakhilalian, M., Rijmen, V., Modarres-Hashemi, M.: Improved Impossible Differential Cryptanalysis of 7-Round AES-128. In: Gong, G., Gupta, K.C. (eds.) INDOCRYPT 2010. LNCS, vol.\u00a06498, pp. 282\u2013291. Springer, Heidelberg (2010)"},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/3-540-48285-7_33","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"M. Matsui","year":"1994","unstructured":"Matsui, M.: Linear Cryptanalysis Method for DES Cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 386\u2013397. Springer, Heidelberg (1994)"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"M. Matsui","year":"1994","unstructured":"Matsui, M.: The First Experimental Cryptanalysis of the Data Encryption Standard. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 1\u201311. Springer, Heidelberg (1994)"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-45661-9_4","volume-title":"Fast Software Encryption","author":"D. Moon","year":"2002","unstructured":"Moon, D., Hwang, K., Lee, W., Lee, S., Lim, J.: Impossible Differential Cryptanalysis of Reduced Round XTEA and TEA. In: Daemen, J., Rijmen, V. (eds.) FSE 2002. LNCS, vol.\u00a02365, pp. 49\u201360. Springer, Heidelberg (2002)"},{"key":"3_CR34","unstructured":"Needham, R.M., Wheeler, D.J.: Tea extensions. Technical report, Computer Laboratory, University of Cambridge (October 1997), http:\/\/www.cix.co.uk\/~klockstone\/xtea.pdf"},{"issue":"1-2","key":"3_CR35","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0166-218X(00)00351-6","volume":"111","author":"K. Nyberg","year":"2001","unstructured":"Nyberg, K.: Correlation theorems in cryptanalysis. Discrete Applied Mathematics\u00a0111(1-2), 177\u2013188 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"3_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-60590-8_10","volume-title":"Fast Software Encryption","author":"L. O\u2019Connor","year":"1995","unstructured":"O\u2019Connor, L.: Properties of Linear Approximation Tables. In: Preneel, B. (ed.) FSE 1994. LNCS, vol.\u00a01008, pp. 131\u2013136. Springer, Heidelberg (1995)"},{"key":"3_CR37","unstructured":"R\u00f6ck, A., Nyberg, K.: Exploiting Linear Hull in Matsui\u2019s Algorithm 1. In: WCC 2011 (2011)"},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-19074-2_17","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"G. Sekar","year":"2011","unstructured":"Sekar, G., Mouha, N., Velichkov, V., Preneel, B.: Meet-in-the-Middle Attacks on Reduced-Round XTEA. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol.\u00a06558, pp. 250\u2013267. Springer, Heidelberg (2011)"},{"issue":"1","key":"3_CR39","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s00145-007-9013-7","volume":"21","author":"A.A. Sel\u00e7uk","year":"2008","unstructured":"Sel\u00e7uk, A.A.: On Probability of Success in Linear and Differential Cryptanalysis. Journal of Cryptology\u00a021(1), 131\u2013147 (2008)","journal-title":"Journal of Cryptology"},{"key":"3_CR40","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 (Extended Abstract). In: Biryukov, A. (ed.) FSE 2007. LNCS, vol.\u00a04593, pp. 181\u2013195. Springer, Heidelberg (2007)"},{"key":"3_CR41","unstructured":"Steil, M.: 17 Mistakes Microsoft Made in the Xbox Security System. Chaos Communication Congress (2005), http:\/\/events.ccc.de\/congress\/2005\/fahrplan\/events\/559.en.html"},{"key":"3_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-71039-4_25","volume-title":"Fast Software Encryption","author":"Y. Tsunoo","year":"2008","unstructured":"Tsunoo, Y., Tsujihara, E., Shigeri, M., Saito, T., Suzaki, T., Kubo, H.: Impossible Differential Cryptanalysis of CLEFIA. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol.\u00a05086, pp. 398\u2013411. Springer, Heidelberg (2008)"},{"issue":"4","key":"3_CR43","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"},{"key":"3_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/3-540-60590-8_29","volume-title":"Fast Software Encryption","author":"D.J. Wheeler","year":"1995","unstructured":"Wheeler, D.J., Needham, R.M.: TEA, a Tiny Encryption Algorithm. In: Preneel, B. (ed.) FSE 1994. LNCS, vol.\u00a01008, pp. 363\u2013366. Springer, Heidelberg (1995)"},{"key":"3_CR45","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","Fast Software Encryption"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34047-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,28]],"date-time":"2022-01-28T14:33:10Z","timestamp":1643380390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34047-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642340468","9783642340475"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34047-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}