{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:58:26Z","timestamp":1774335506102,"version":"3.50.1"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031306334","type":"print"},{"value":"9783031306341","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30634-1_5","type":"book-chapter","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T23:03:07Z","timestamp":1681513387000},"page":"128-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Finding the\u00a0Impossible: Automated Search for\u00a0Full Impossible-Differential, Zero-Correlation, and\u00a0Integral Attacks"],"prefix":"10.1007","author":[{"given":"Hosein","family":"Hadipour","sequence":"first","affiliation":[]},{"given":"Sadegh","family":"Sadeghi","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Eichlseder","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Ankele, R., Dobraunig, C., Guo, J., Lambooij, E., Leander, G., Todo, Y.: Zero-correlation attacks on tweakable block ciphers with linear tweakey expansion. IACR Trans. Symmetric Cryptol. 2019(1), 192\u2013235 (2019). https:\/\/doi.org\/10.13154\/tosc.v2019.i1.192-235","DOI":"10.13154\/tosc.v2019.i1.192-235"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Avanzi, R.: The QARMA block cipher family. almost MDS matrices over rings with zero divisors, nearly symmetric even-mansour constructions with non-involutory central rounds, and search heuristics for low-latency s-boxes. IACR Trans. Symmetric Cryptol. 2017(1), 4\u201344 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i1.4-44","DOI":"10.13154\/tosc.v2017.i1.4-44"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-662-53008-5_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"C Beierle","year":"2016","unstructured":"Beierle, C., Jean, J., K\u00f6lbl, S., Leander, G., Moradi, A., Peyrin, T., Sasaki, Yu., Sasdrich, P., Sim, S.M.: The SKINNY family of block ciphers and its low-latency variant MANTIS. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 123\u2013153. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_5"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Beierle, C., Leander, G., Moradi, A., Rasoolzadeh, S.: CRAFT: lightweight tweakable block cipher with efficient protection against DFA attacks. IACR Trans. Symmetric Cryptol. 2019(1), 5\u201345 (2019). https:\/\/doi.org\/10.13154\/tosc.v2019.i1.5-45","DOI":"10.13154\/tosc.v2019.i1.5-45"},{"key":"5_CR5","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 \u2014 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. 1592, pp. 12\u201323. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_2"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/3-540-48519-8_10","volume-title":"Fast Software Encryption","author":"E Biham","year":"1999","unstructured":"Biham, E., Biryukov, A., Shamir, A.: Miss in the middle attacks on IDEA and Khufu. In: Knudsen, L. (ed.) FSE 1999. LNCS, vol. 1636, pp. 124\u2013138. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48519-8_10"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-34961-4_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"A Bogdanov","year":"2012","unstructured":"Bogdanov, A., Leander, G., Nyberg, K., Wang, M.: Integral and multidimensional linear distinguishers with correlation zero. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 244\u2013261. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_16"},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10623-012-9697-z","volume":"70","author":"A Bogdanov","year":"2012","unstructured":"Bogdanov, A., Rijmen, V.: Linear hulls with correlation zero and linear cryptanalysis of block ciphers. Des. Codes Crypt. 70(3), 369\u2013383 (2012). https:\/\/doi.org\/10.1007\/s10623-012-9697-z","journal-title":"Des. Codes Crypt."},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-34047-5_3","volume-title":"Fast Software Encryption","author":"A Bogdanov","year":"2012","unstructured":"Bogdanov, A., Wang, M.: Zero correlation linear cryptanalysis with reduced data complexity. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol. 7549, pp. 29\u201348. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34047-5_3"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s00145-016-9251-7","volume":"31","author":"C Boura","year":"2017","unstructured":"Boura, C., Lallemand, V., Naya-Plasencia, M., Suder, V.: Making the impossible possible. J. Cryptol. 31(1), 101\u2013133 (2017). https:\/\/doi.org\/10.1007\/s00145-016-9251-7","journal-title":"J. Cryptol."},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-662-45611-8_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"C Boura","year":"2014","unstructured":"Boura, C., Naya-Plasencia, M., Suder, V.: Scrutinizing and improving impossible differential attacks: applications to CLEFIA, Camellia, LBlock and Simon. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 179\u2013199. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_10"},{"key":"5_CR12","unstructured":"Cui, T., Chen, S., Jia, K., Fu, K., Wang, M.: New automatic search tool for impossible differentials and zero-correlation linear approximations. IACR Cryptol, ePrint Archive, Report 2016\/689 (2016), https:\/\/eprint.iacr.org\/2016\/689"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BFb0052343","volume-title":"Fast Software Encryption","author":"J Daemen","year":"1997","unstructured":"Daemen, J., Knudsen, L., Rijmen, V.: The block cipher Square. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 149\u2013165. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052343"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Derbez, P., Fouque, P.-A.: Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 157\u2013184. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_6","DOI":"10.1007\/978-3-662-53008-5_6"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Eskandari, Z., Kidmose, A.B., K\u00f6lbl, S., Tiessen, T.: Finding integral distinguishers with ease. In: SAC. LNCS, vol. 11349, pp. 115\u2013138. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_6","DOI":"10.1007\/978-3-030-10970-7_6"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44706-7_15","volume-title":"Fast Software Encryption","author":"N Ferguson","year":"2001","unstructured":"Ferguson, N., et al.: Improved cryptanalysis of Rijndael. In: Goos, G., Hartmanis, J., van Leeuwen, J., Schneier, B. (eds.) FSE 2000. LNCS, vol. 1978, pp. 213\u2013230. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44706-7_15"},{"key":"5_CR17","unstructured":"Gurobi Optimization LLC: Gurobi Optimizer Reference Manual (2022). https:\/\/www.gurobi.com"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Hadipour, H., Eichlseder, M.: Autoguess: A tool for finding guess-and-determine attacks and key bridges. In: ACNS 2022. LNCS, vol. 13269, pp. 230\u2013250. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09234-3_12","DOI":"10.1007\/978-3-031-09234-3_12"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Hadipour, H., Eichlseder, M.: Integral cryptanalysis of WARP based on monomial prediction. IACR Trans. Symmetric Cryptol. 2022(2), 92\u2013112 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i2.92-112","DOI":"10.46586\/tosc.v2022.i2.92-112"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Hadipour, H., Nageler, M., Eichlseder, M.: Throwing boomerangs into feistel structures: Application to CLEFIA, WARP, LBlock, LBlock-s and TWINE. IACR Trans. Symmetric Cryptol. 2022(3), 271\u2013302 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i3.271-302","DOI":"10.46586\/tosc.v2022.i3.271-302"},{"key":"5_CR21","unstructured":"Hadipour, H., Sadeghi, S., Eichlseder, M.: Finding the impossible: Automated search for full impossible differential, zero-correlation, and integral attacks. IACR Cryptology ePrint Archive, Report 2022\/1147, p. 92 (2022). https:\/\/eprint.iacr.org\/2022\/1147"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Hadipour, H., Sadeghi, S., Niknam, M.M., Song, L., Bagheri, N.: Comprehensive security analysis of CRAFT. IACR Trans. Symmetric Cryptol. 2019(4), 290\u2013317 (2019). https:\/\/doi.org\/10.13154\/tosc.v2019.i4.290-317","DOI":"10.13154\/tosc.v2019.i4.290-317"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-030-64837-4_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"K Hu","year":"2020","unstructured":"Hu, K., Sun, S., Wang, M., Wang, Q.: An algebraic formulation of the division property: revisiting degree evaluations, cube attacks, and key-independent sums. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 446\u2013476. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_15"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-662-45608-8_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"J Jean","year":"2014","unstructured":"Jean, J., Nikoli\u0107, I., Peyrin, T.: Tweaks and keys for block ciphers: The TWEAKEY framework. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 274\u2013288. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_15"},{"key":"5_CR25","unstructured":"Knudsen, L.: Deal-a 128-bit block cipher. Complexity 258(2), 216 (1998)"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Lai, X.: Higher order derivatives and differential cryptanalysis, pp. 227\u2013233 (1994). https:\/\/doi.org\/10.1007\/978-1-4615-2694-0_23","DOI":"10.1007\/978-1-4615-2694-0_23"},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"Liu, G., Ghosh, M., Song, L.: Security analysis of SKINNY under related-tweakey settings. IACR Trans. Symmetric Cryptol. 2017(3), 37\u201372 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i3.37-72","DOI":"10.13154\/tosc.v2017.i3.37-72"},{"key":"5_CR28","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. 5365, pp. 279\u2013293. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89754-5_22"},{"key":"5_CR29","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., 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. 4964, pp. 370\u2013386. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79263-5_24"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-34704-7_5","volume-title":"Information Security and Cryptology","author":"N Mouha","year":"2012","unstructured":"Mouha, N., Wang, Q., Gu, D., Preneel, B.: Differential and linear cryptanalysis using mixed-integer linear programming. In: Wu, C.-K., Yung, M., Lin, D. (eds.) Inscrypt 2011. LNCS, vol. 7537, pp. 57\u201376. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34704-7_5"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/978-3-030-45724-2_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"Y Naito","year":"2020","unstructured":"Naito, Y., Sasaki, Yu., Sugawara, T.: Lightweight authenticated encryption mode suitable for threshold implementation. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 705\u2013735. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_24"},{"key":"5_CR32","doi-asserted-by":"publisher","unstructured":"Naito, Y., Sasaki, Y., Sugawara, T.: Secret can be public: Low-memory AEAD mode for high-order masking. In: CRYPTO 2022. LNCS, vol. 13509, pp. 315\u2013345. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_11","DOI":"10.1007\/978-3-031-15982-4_11"},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-030-75539-3_6","volume-title":"Topics in Cryptology \u2013 CT-RSA 2021","author":"C Niu","year":"2021","unstructured":"Niu, C., Li, M., Sun, S., Wang, M.: Zero-correlation linear cryptanalysis with equal treatment for plaintexts and tweakeys. In: Paterson, K.G. (ed.) CT-RSA 2021. LNCS, vol. 12704, pp. 126\u2013147. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75539-3_6"},{"key":"5_CR35","unstructured":"Perron, L., Furnon, V.: OR-Tools. https:\/\/developers.google.com\/optimization\/"},{"key":"5_CR36","doi-asserted-by":"publisher","unstructured":"Sadeghi, S., Mohammadi, T., Bagheri, N.: Cryptanalysis of reduced round SKINNY block cipher. IACR Trans. Symmetric Cryptol. 2018(3), 124\u2013162 (2018). https:\/\/doi.org\/10.13154\/tosc.v2018.i3.124-162","DOI":"10.13154\/tosc.v2018.i3.124-162"},{"key":"5_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-56617-7_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"Yu Sasaki","year":"2017","unstructured":"Sasaki, Yu., Todo, Y.: New impossible differential search tool from design and cryptanalysis aspects. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 185\u2013215. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_7"},{"key":"5_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-35999-6_16","volume-title":"Selected Areas in Cryptography","author":"Yu Sasaki","year":"2013","unstructured":"Sasaki, Yu., Wang, L.: Meet-in-the-middle technique for integral attacks against feistel ciphers. In: Knudsen, L.R., Wu, H. (eds.) SAC 2012. LNCS, vol. 7707, pp. 234\u2013251. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35999-6_16"},{"key":"5_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-03329-3_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"D Shi","year":"2018","unstructured":"Shi, D., Sun, S., Derbez, P., Todo, Y., Sun, B., Hu, L.: Programming the Demirci-Sel\u00e7uk meet-in-the-middle attack with constraints. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11273, pp. 3\u201334. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_1"},{"key":"5_CR40","doi-asserted-by":"publisher","unstructured":"Song, L., et al.: Optimizing rectangle attacks: A unified and generic framework for key recovery. In: ASIACRYPT 2022. LNCS, vol. 13791, pp. 410\u2013440. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_14","DOI":"10.1007\/978-3-031-22963-3_14"},{"key":"5_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-662-47989-6_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"B Sun","year":"2015","unstructured":"Sun, B., et al.: Links among impossible differential, integral and zero correlation linear cryptanalysis. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 95\u2013115. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_5"},{"key":"5_CR42","doi-asserted-by":"publisher","unstructured":"Sun, L., Gerault, D., Wang, W., Wang, M.: On the usage of deterministic (related-key) truncated differentials and multidimensional linear approximations for spn ciphers. IACR Trans. Symmetric Cryptol. 2020(3), 262\u2013287 (2020). https:\/\/doi.org\/10.13154\/tosc.v2020.i3.262-287","DOI":"10.13154\/tosc.v2020.i3.262-287"},{"key":"5_CR43","doi-asserted-by":"publisher","unstructured":"Sun, S., et al.: Analysis of aes, skinny, and others with constraint programming. IACR Trans. Symmetric Cryptol. 2017(1), 281\u2013306 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i1.281-306","DOI":"10.13154\/tosc.v2017.i1.281-306"},{"key":"5_CR44","doi-asserted-by":"publisher","unstructured":"Todo, Y.: Structural evaluation by generalized integral property. In: EUROCRYPT 2015. LNCS, vol. 9056, pp. 287\u2013314. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_12","DOI":"10.1007\/978-3-662-46800-5_12"},{"key":"5_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-57339-7_7","volume-title":"Progress in Cryptology - AFRICACRYPT 2017","author":"M Tolba","year":"2017","unstructured":"Tolba, M., Abdelkhalek, A., Youssef, A.M.: Impossible differential cryptanalysis of reduced-round SKINNY. In: Joye, M., Nitaj, A. (eds.) AFRICACRYPT 2017. LNCS, vol. 10239, pp. 117\u2013134. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57339-7_7"},{"key":"5_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/978-3-662-53887-6_24","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"Z Xiang","year":"2016","unstructured":"Xiang, Z., Zhang, W., Bao, Z., Lin, D.: Applying MILP Method to Searching Integral Distinguishers Based on Division Property for 6 Lightweight Block Ciphers. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 648\u2013678. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_24"},{"issue":"6","key":"5_CR47","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1049\/iet-ifs.2016.0488","volume":"11","author":"D Yang","year":"2017","unstructured":"Yang, D., Qi, W., Chen, H.: Impossible differential attacks on the SKINNY family of block ciphers. IET Inf. Secur. 11(6), 377\u2013385 (2017). https:\/\/doi.org\/10.1049\/iet-ifs.2016.0488","journal-title":"IET Inf. Secur."},{"key":"5_CR48","doi-asserted-by":"publisher","unstructured":"Zhang, Y., Cui, T., Wang, C.: Zero-correlation linear attack on reduced-round SKINNY. Frontiers of Comput. Sci. 17(174808 (2023)), 377\u2013385 (2022). https:\/\/doi.org\/10.1007\/s11704-022-2206-2","DOI":"10.1007\/s11704-022-2206-2"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30634-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:03:39Z","timestamp":1744754619000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30634-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306334","9783031306341"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30634-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"415","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"109","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}