{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:56:42Z","timestamp":1743069402452,"version":"3.40.3"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031710728"},{"type":"electronic","value":"9783031710735"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-71073-5_7","type":"book-chapter","created":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T22:02:12Z","timestamp":1725919332000},"page":"140-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Indifferentiability of\u00a03-Round Confusion-Diffusion Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2883-4870","authenticated-orcid":false,"given":"Ritam","family":"Bhaumik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1029-6576","authenticated-orcid":false,"given":"Mridul","family":"Nandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-0275-8717","authenticated-orcid":false,"given":"Sayantan","family":"Paul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9178-1679","authenticated-orcid":false,"given":"Abishanka","family":"Saha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,10]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-44983-3_4","volume-title":"Selected Areas in Cryptography","author":"K Aoki","year":"2001","unstructured":"Aoki, K., et al.: Camellia: a 128-bit block cipher suitable for multiple platforms\u2014design and analysis. In: Stinson, D.R., Tavares, S. (eds.) SAC 2000. LNCS, vol. 2012, pp. 39\u201356. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44983-3_4"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/11693383_5","volume-title":"Selected Areas in Cryptography","author":"T Baign\u00e8res","year":"2006","unstructured":"Baign\u00e8res, T., Vaudenay, S.: Proving the security of AES substitution-permutation network. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 65\u201381. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11693383_5"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Beaulieu, R., Treatman-Clark, S., Shors, D., Weeks, B., Smith, J., Wingers, L.: The SIMON and SPECK lightweight block ciphers. In: 2015 52nd ACM\/EDAC\/IEEE Design Automation Conference (DAC) (2015). https:\/\/doi.org\/10.1145\/2744769.2747946","DOI":"10.1145\/2744769.2747946"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: ACM CCS 1993. Association for Computing Machinery, New York (1993). https:\/\/doi.org\/10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-319-78381-9_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"S Bhattacharya","year":"2018","unstructured":"Bhattacharya, S., Nandi, M.: Full indifferentiable security of the Xor of two or more random permutations using the $$\\chi ^2$$ Method. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 387\u2013412. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_15"},{"issue":"10","key":"7_CR6","doi-asserted-by":"publisher","first-page":"2255","DOI":"10.1007\/S10623-021-00913-4","volume":"89","author":"R Bhaumik","year":"2021","unstructured":"Bhaumik, R., Nandi, M., Raychaudhuri, A.: Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff. Des. Codes Cryptogr. 89(10), 2255\u20132281 (2021). https:\/\/doi.org\/10.1007\/S10623-021-00913-4","journal-title":"Des. Codes Cryptogr."},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-69710-1_15","volume-title":"Fast Software Encryption","author":"E Biham","year":"1998","unstructured":"Biham, E., Anderson, R., Knudsen, L.: Serpent: a new block cipher proposal. In: Vaudenay, S. (ed.) FSE 1998. LNCS, vol. 1372, pp. 222\u2013238. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-69710-1_15"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/3-540-60590-8_8","volume-title":"Fast Software Encryption","author":"M Blaze","year":"1995","unstructured":"Blaze, M., Schneier, B.: The MacGuffin block cipher algorithm. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 97\u2013110. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60590-8_8"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-540-74735-2_31","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2007","author":"A Bogdanov","year":"2007","unstructured":"Bogdanov, A., Knudsen, L.R., Leander, G., Paar, C., Poschmann, A., Robshaw, M.J.B., Seurin, Y., Vikkelsoe, C.: PRESENT: an ultra-lightweight block cipher. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 450\u2013466. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74735-2_31"},{"key":"7_CR10","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. 4047, pp. 293\u2013309. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11799313_19"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-55220-5_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S Chen","year":"2014","unstructured":"Chen, S., Steinberger, J.: Tight security bounds for key-alternating ciphers. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 327\u2013350. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_19"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1007\/978-3-319-96884-1_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"B Cogliati","year":"2018","unstructured":"Cogliati, B., et al.: Provable security of (tweakable) block ciphers based on substitution-permutation networks. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 722\u2013753. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_24"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-642-11799-2_17","volume-title":"Theory of Cryptography","author":"J-S Coron","year":"2010","unstructured":"Coron, J.-S., Dodis, Y., Mandal, A., Seurin, Y.: A domain extender for the ideal cipher. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 273\u2013289. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_17"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-85174-5_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J-S Coron","year":"2008","unstructured":"Coron, J.-S., Patarin, J., Seurin, Y.: The random oracle model and the ideal cipher model are equivalent. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 1\u201320. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_1"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-030-92518-5_5","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2021","author":"Q Da","year":"2021","unstructured":"Da, Q., Xu, S., Guo, C.: Sequential indifferentiability of\u00a0confusion-diffusion networks. In: Adhikari, A., K\u00fcsters, R., Preneel, B. (eds.) INDOCRYPT 2021. LNCS, vol. 13143, pp. 93\u2013113. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92518-5_5"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/978-3-662-49896-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"D Dachman-Soled","year":"2016","unstructured":"Dachman-Soled, D., Katz, J., Thiruvengadam, A.: 10-round feistel is indifferentiable from an ideal cipher. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 649\u2013678. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_23"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/10721064_26","volume-title":"Smart Card Research and Applications","author":"J Daemen","year":"2000","unstructured":"Daemen, J., Rijmen, V.: The block cipher Rijndael. In: Quisquater, J.-J., Schneier, B. (eds.) CARDIS 1998. LNCS, vol. 1820, pp. 277\u2013284. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10721064_26"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-662-53018-4_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"Y Dai","year":"2016","unstructured":"Dai, Y., Steinberger, J.: Indifferentiability of 8-round feistel networks. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 95\u2013120. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_4"},{"key":"7_CR19","unstructured":"Dodis, Y., Katz, J., Steinberger, J., Thiruvengadam, A., Zhang, Z.: Provable security of substitution-permutation networks. Cryptology ePrint Archive, Paper 2017\/016 (2017). https:\/\/eprint.iacr.org\/2017\/016"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-662-49896-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"Y Dodis","year":"2016","unstructured":"Dodis, Y., Stam, M., Steinberger, J., Liu, T.: Indifferentiability of confusion-diffusion networks. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 679\u2013704. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_24"},{"key":"7_CR21","unstructured":"Feistel, H.: Cryptographic coding for data-bank privacy. Technical report, Watson Research Center, Yorktown Heights, New York (1970). https:\/\/dominoweb.draco.res.ibm.com\/reports\/RC2827.pdf"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Gao, Y., Guo, C., Wang, M., Wang, W., Wen, J.: Beyond-birthday-bound security for 4-round linear substitution-permutation networks. IACR Trans. Symmetric Cryptol. 2020, 305\u2013326 (2020). https:\/\/doi.org\/10.13154\/tosc.v2020.i3.305-326","DOI":"10.13154\/tosc.v2020.i3.305-326"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-031-38548-3_21","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"A Gunsing","year":"2023","unstructured":"Gunsing, A., Bhaumik, R., Jha, A., Mennink, B., Shen, Y.: Revisiting the indifferentiability of the sum of permutations. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14083, pp. 628\u2013660. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_21"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-642-14623-7_33","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"VT Hoang","year":"2010","unstructured":"Hoang, V.T., Rogaway, P.: On generalized feistel networks. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 613\u2013630. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_33"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Holenstein, T., K\u00fcnzler, R., Tessaro, S.: The equivalence of the random oracle model and the ideal cipher model, revisited. In: ACM STOC 2011. Association for Computing Machinery, New York (2011). https:\/\/doi.org\/10.1145\/1993636.1993650","DOI":"10.1145\/1993636.1993650"},{"key":"7_CR26","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: Goos, G., Hartmanis, J., van Leeuwen, J., Schneier, B. (eds.) FSE 2000. LNCS, vol. 1978, pp. 231\u2013243. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44706-7_16"},{"key":"7_CR27","unstructured":"Jean, J.: TikZ for cryptographers (2016). https:\/\/www.iacr.org\/authors\/tikz\/"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Jha, A., Nandi, M.: A survey on applications of h-technique: revisiting security analysis of PRP and PRF. Entropy 24(4) (2022). https:\/\/doi.org\/10.3390\/e24040462","DOI":"10.3390\/e24040462"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-03317-9_17","volume-title":"Fast Software Encryption","author":"P Junod","year":"2009","unstructured":"Junod, P., Macchetti, M.: Revisiting the IDEA philosophy. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol. 5665, pp. 277\u2013295. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03317-9_17"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-30564-4_8","volume-title":"Selected Areas in Cryptography","author":"P Junod","year":"2004","unstructured":"Junod, P., Vaudenay, S.: FOX: a new family of block ciphers. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol. 3357, pp. 114\u2013129. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30564-4_8"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Keliher, L., Meijer, H., Tavares, S.: Provable security of substitution-permutation encryption networks against linear cryptanalysis. In: 2000 Canadian Conference on Electrical and Computer Engineering. Conference Proceedings. Navigating to a New Era (Cat. No.00TH8492) (2000). https:\/\/doi.org\/10.1109\/CCECE.2000.849666","DOI":"10.1109\/CCECE.2000.849666"},{"key":"7_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/3-540-46877-3_35","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201990","author":"X Lai","year":"1991","unstructured":"Lai, X., Massey, J.L.: A proposal for a new block encryption standard. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 389\u2013404. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46877-3_35"},{"key":"7_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-031-38548-3_23","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"T Liu","year":"2023","unstructured":"Liu, T., Pelecanos, A., Tessaro, S., Vaikuntanathan, V.: Layout graphs, random walks and the t-wise independence of SPN block ciphers. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14083, pp. 694\u2013726. Springer, Cham (2023)"},{"issue":"2","key":"7_CR34","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. 17(2), 373\u2013386 (1988). https:\/\/doi.org\/10.1137\/0217022","journal-title":"SIAM J. Comput."},{"key":"7_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-24638-1_2","volume-title":"Theory of Cryptography","author":"U Maurer","year":"2004","unstructured":"Maurer, U., Renner, R., Holenstein, C.: Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 21\u201339. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_2"},{"key":"7_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/3-540-38424-3_34","volume-title":"Advances in Cryptology-CRYPT0\u2019 90","author":"RC Merkle","year":"1991","unstructured":"Merkle, R.C.: Fast software encryption functions. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 477\u2013501. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-38424-3_34"},{"key":"7_CR37","doi-asserted-by":"publisher","unstructured":"Miles, E., Viola, E.: Substitution-permutation networks, pseudorandom functions, and natural proofs. J. ACM 62(6) (2015). https:\/\/doi.org\/10.1145\/2792978","DOI":"10.1145\/2792978"},{"key":"7_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-540-24591-9_34","volume-title":"Information Security Applications","author":"J Nakahara","year":"2004","unstructured":"Nakahara, J., Rijmen, V., Preneel, B., Vandewalle, J.: The MESH block ciphers. In: Chae, K.-J., Yung, M. (eds.) WISA 2003. LNCS, vol. 2908, pp. 458\u2013473. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24591-9_34"},{"key":"7_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-031-33017-9_12","volume-title":"Codes, Cryptology and Information Security","author":"M Nandi","year":"2023","unstructured":"Nandi, M., Paul, S., Saha, A.: Indifferentiability of the confusion-diffusion network and the cascade block cipher. In: El Hajji, S., Mesnager, S., Souidi, E.M. (eds.) C2SI 2023. LNCS, vol. 13874, pp. 178\u2013195. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-33017-9_12"},{"key":"7_CR40","doi-asserted-by":"publisher","unstructured":"Naor, M., Reingold, O.: On the construction of pseudorandom permutations: Luby-Rackoff revisited. J. Cryptol. 29\u201366 (1999). https:\/\/doi.org\/10.1007\/PL00003817","DOI":"10.1007\/PL00003817"},{"key":"7_CR41","unstructured":"National Institute of Standards and Technology: Data Encryption Standard. Technical report Federal Information Processing Standards Publications (FIPS PUBS) 46, January 15, 1977, U.S. Department of Commerce, Washington, D.C. (1977). https:\/\/csrc.nist.gov\/files\/pubs\/fips\/46\/final\/docs\/nbs.fips.46.pdf"},{"key":"7_CR42","unstructured":"National Institute of Standards and Technology: SKIPJACK and KEA algorithm specification. Technical report (1998). https:\/\/csrc.nist.gov\/csrc\/media\/projects\/cryptographic-algorithm-validation-program\/documents\/skipjack\/skipjack.pdf"},{"key":"7_CR43","unstructured":"National Soviet Bureau of Standards: GOST 28147-89: Encryption, Decryption, and Message Authentication Code (MAC) Algorithms. Technical report (1989). https:\/\/www.rfc-editor.org\/rfc\/rfc5830.html"},{"key":"7_CR44","unstructured":"National Soviet Bureau of Standards: GOST R 34.12-2015: Block Cipher \u201cKuznyechik\u201d. Technical report (2015). https:\/\/www.rfc-editor.org\/rfc\/rfc7801.html"},{"key":"7_CR45","unstructured":"Oliynykov, R., et al.: A new encryption standard of Ukraine: the Kalyna block cipher. Cryptology ePrint Archive, Paper 2015\/650 (2015). https:\/\/eprint.iacr.org\/2015\/650"},{"key":"7_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-04159-4_21","volume-title":"Selected Areas in Cryptography","author":"J Patarin","year":"2009","unstructured":"Patarin, J.: The \u201ccoefficients H\u2019\u2019 technique. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol. 5381, pp. 328\u2013345. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04159-4_21"},{"issue":"4","key":"7_CR47","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28(4), 656\u2013715 (1949). https:\/\/doi.org\/10.1002\/j.1538-7305.1949.tb00928.x","journal-title":"Bell Syst. Tech. J."},{"issue":"7","key":"7_CR48","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1002\/scj.4690190703","volume":"19","author":"A Shimizu","year":"1988","unstructured":"Shimizu, A., Miyaguchi, S.: FEAL - fast data encipherment algorithm. Syst. Comput. Jpn. 19(7), 20\u201334 (1988). https:\/\/doi.org\/10.1002\/scj.4690190703","journal-title":"Syst. Comput. Jpn."},{"issue":"1","key":"7_CR49","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1080\/0161-118491858746","volume":"8","author":"A Sorkin","year":"1984","unstructured":"Sorkin, A.: Lucifer, a cryptographic algorithm. Cryptologia 8(1), 22\u201342 (1984). https:\/\/doi.org\/10.1080\/0161-118491858746","journal-title":"Cryptologia"},{"key":"7_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-540-48000-6_2","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. 1716, pp. 8\u201319. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48000-6_2"},{"key":"7_CR51","doi-asserted-by":"publisher","unstructured":"Zhang, W., Bao, Z., Lin, D., Rijmen, V., Yang, B., Verbauwhede, I.: RECTANGLE: a bit-slice lightweight block cipher suitable for multiple platforms. Sci. China Inf. Sci. (2015). https:\/\/doi.org\/10.1007\/s11432-015-5459-7","DOI":"10.1007\/s11432-015-5459-7"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-71073-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T22:02:53Z","timestamp":1725919373000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71073-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031710728","9783031710735"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71073-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"10 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SCN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Cryptography for Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amalfi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/scn.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}