{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:17:49Z","timestamp":1743124669411,"version":"3.40.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030755386"},{"type":"electronic","value":"9783030755393"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-75539-3_14","type":"book-chapter","created":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T23:36:24Z","timestamp":1620689784000},"page":"326-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Related-Key Analysis of Generalized Feistel Networks with Expanding Round Functions"],"prefix":"10.1007","author":[{"given":"Yuqing","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenqi","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,11]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-662-44371-2_5","volume-title":"Advances in Cryptology","author":"M Abdalla","year":"2014","unstructured":"Abdalla, M., Benhamouda, F., Passel\u00e8gue, A., Paterson, K.G.: Related-key security for pseudorandom functions beyond the linear barrier. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 77\u201394. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_5"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/3-540-60865-6_48","volume-title":"Fast Software Encryption","author":"R Anderson","year":"1996","unstructured":"Anderson, R., Biham, E.: Two practical and provably secure block ciphers: BEAR and LION. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 113\u2013120. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60865-6_48"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Anderson, R.J., Kuhn, M.G.: Low cost attacks on tamper resistant devices. In: Security Protocols, 5th International Workshop, Paris, France, April 7\u20139, 1997, Proceedings, pp. 125\u2013136 (1997). https:\/\/doi.org\/10.1007\/BFb0028165","DOI":"10.1007\/BFb0028165"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-662-48800-3_17","volume-title":"Advances in Cryptology","author":"S Banik","year":"2015","unstructured":"Banik, S., et al.: Midori: a block cipher for low energy. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 411\u2013436. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_17"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-662-46706-0_14","volume-title":"Fast Software Encryption","author":"M Barbosa","year":"2015","unstructured":"Barbosa, M., Farshim, P.: The related-key analysis of Feistel constructions. In: Cid, C., Rechberger, C. (eds.) FSE 2014. LNCS, vol. 8540, pp. 265\u2013284. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46706-0_14"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1007\/978-3-642-14623-7_36","volume-title":"Advances in Cryptology","author":"M Bellare","year":"2010","unstructured":"Bellare, M., Cash, D.: Pseudorandom functions and permutations provably secure against related-key attacks. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 666\u2013684. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_36"},{"key":"14_CR7","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","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. 2656, pp. 491\u2013506. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_31"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-05445-7_19","volume-title":"Selected Areas in Cryptography","author":"M Bellare","year":"2009","unstructured":"Bellare, M., Ristenpart, T., Rogaway, P., Stegers, T.: Format-preserving encryption. In: Jacobson, M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol. 5867, pp. 295\u2013312. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05445-7_19"},{"issue":"4","key":"14_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00203965","volume":"7","author":"E Biham","year":"1994","unstructured":"Biham, E.: New types of cryptanalytic attacks using related keys. J. Cryptol. 7(4), 229\u2013246 (1994). https:\/\/doi.org\/10.1007\/BF00203965","journal-title":"J. Cryptol."},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-13190-5_15","volume-title":"Advances in Cryptology","author":"A Biryukov","year":"2010","unstructured":"Biryukov, A., Dunkelman, O., Keller, N., Khovratovich, D., Shamir, A.: Key recovery attacks of practical complexity on AES-256 variants with up to 10 rounds. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 299\u2013319. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_15"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/3-540-48519-8_18","volume-title":"Fast Software Encryption","author":"A Biryukov","year":"1999","unstructured":"Biryukov, A., Wagner, D.: Slide attacks. In: Knudsen, L. (ed.) FSE 1999. LNCS, vol. 1636, pp. 245\u2013259. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48519-8_18"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/3-540-45539-6_41","volume-title":"Advances in Cryptology","author":"A Biryukov","year":"2000","unstructured":"Biryukov, A., Wagner, D.: Advanced slide attacks. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 589\u2013606. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_41"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-45760-7_9","volume-title":"Topics in Cryptology","author":"J Black","year":"2002","unstructured":"Black, J., Rogaway, P.: Ciphers with arbitrary finite domains. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 114\u2013130. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45760-7_9"},{"key":"14_CR14","unstructured":"Brightwell, M., Smith, H.: Using datatype-preserving encryption to enhance data warehouse security. In: 20th NISSC Proceedings (1997). http:\/\/csrc.nist.gov\/nissc\/1997"},{"key":"14_CR15","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","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":"14_CR16","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","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":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/978-3-662-46800-5_23","volume-title":"Advances in Cryptology","author":"B Cogliati","year":"2015","unstructured":"Cogliati, B., Seurin, Y.: On the provable security of the iterated even-Mansour cipher against related-key and chosen-key attacks. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 584\u2013613. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_23"},{"key":"14_CR18","unstructured":"Council, P.S.S.: Payment card industry (PCI) data security standard: requirements and security assessment procedures, version 1.2.1. (2009). www.pcisecuritystandards.org"},{"key":"14_CR19","unstructured":"Diffie, W., (translators), G.L.: SMS4 encryption algorithm for wireless networks. Cryptology ePrint Archive, Report 2008\/329 (2008). http:\/\/eprint.iacr.org\/2008\/329"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-030-45721-1_10","volume-title":"Advances in Cryptology","author":"O Dunkelman","year":"2020","unstructured":"Dunkelman, O., Keller, N., Lasry, N., Shamir, A.: New slide attacks on almost self-similar ciphers. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 250\u2013279. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_10"},{"issue":"4","key":"14_CR21","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1007\/s00145-013-9154-9","volume":"27","author":"O Dunkelman","year":"2014","unstructured":"Dunkelman, O., Keller, N., Shamir, A.: A practical-time related-key attack on the KASUMI cryptosystem used in GSM and 3G telephony. J. Cryptol. 27(4), 824\u2013849 (2014)","journal-title":"J. Cryptol."},{"issue":"1","key":"14_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-013-9164-7","volume":"28","author":"O Dunkelman","year":"2015","unstructured":"Dunkelman, O., Keller, N., Shamir, A.: Slidex attacks on the even-Mansour encryption scheme. J. Cryptol. 28(1), 1\u201328 (2015)","journal-title":"J. Cryptol."},{"key":"14_CR23","doi-asserted-by":"publisher","unstructured":"Dworkin, M.: Recommendation for block cipher modes of operation: methods for format-preserving encryption. NIST Special Publication 800\u201338G (2016). https:\/\/doi.org\/10.6028\/NIST.SP.800-38G","DOI":"10.6028\/NIST.SP.800-38G"},{"key":"14_CR24","unstructured":"EMVCo: EMV Integrated Circuit Card Specifications for Payment Systems, Book 2, Security and Key Management (2008). Version 4.2"},{"issue":"11","key":"14_CR25","doi-asserted-by":"publisher","first-page":"1545","DOI":"10.1109\/PROC.1975.10005","volume":"63","author":"H Feistel","year":"1975","unstructured":"Feistel, H., Notz, W.A., Smith, J.L.: Some cryptographic techniques for machine-to-machine data communications. Proc. IEEE 63(11), 1545\u20131554 (1975)","journal-title":"Proc. IEEE"},{"issue":"8","key":"14_CR26","doi-asserted-by":"publisher","first-page":"5260","DOI":"10.1109\/TIT.2019.2903796","volume":"65","author":"C Guo","year":"2019","unstructured":"Guo, C.: Understanding the related-key security of Feistel ciphers from a provable perspective. IEEE Trans. Inf. Theor. 65(8), 5260\u20135280 (2019). https:\/\/doi.org\/10.1109\/TIT.2019.2903796","journal-title":"IEEE Trans. Inf. Theor."},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-23951-9_22","volume-title":"Cryptographic Hardware and Embedded Systems","author":"J Guo","year":"2011","unstructured":"Guo, J., Peyrin, T., Poschmann, A., Robshaw, M.: The LED block cipher. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 326\u2013341. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_22"},{"key":"14_CR28","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","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":"14_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-540-25937-4_27","volume-title":"Fast Software Encryption","author":"T Iwata","year":"2004","unstructured":"Iwata, T., Kohno, T.: New security proofs for the 3GPP confidentiality and integrity algorithms. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 427\u2013445. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25937-4_27"},{"key":"14_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-57220-1_62","volume-title":"Advances in Cryptology","author":"LR Knudsen","year":"1993","unstructured":"Knudsen, L.R.: Cryptanalysis of LOKI91. In: Seberry, J., Zheng, Y. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 196\u2013208. Springer, Heidelberg (Dec (1993). https:\/\/doi.org\/10.1007\/3-540-57220-1_62"},{"key":"14_CR31","unstructured":"Goubin, L., et al.: Crunch. Submission to NIST (2008)"},{"issue":"2","key":"14_CR32","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)","journal-title":"SIAM J. Comput."},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-60865-6_53","volume-title":"Fast Software Encryption","author":"S Lucks","year":"1996","unstructured":"Lucks, S.: Faster Luby-Rackoff ciphers. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 189\u2013203. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60865-6_53"},{"issue":"5\u20136","key":"14_CR34","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s00200-011-0159-z","volume":"22","author":"L Maines","year":"2011","unstructured":"Maines, L., Piva, M., Rimoldi, A., Sala, M.: On the provable security of BEAR and LION schemes. Appl. Algebra Eng. Commun. Comput. 22(5\u20136), 413\u2013423 (2011). https:\/\/doi.org\/10.1007\/s00200-011-0159-z","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"14_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-03356-8_17","volume-title":"Advances in Cryptology","author":"B Morris","year":"2009","unstructured":"Morris, B., Rogaway, P., Stegers, T.: How to encipher messages on a small domain. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 286\u2013302. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_17"},{"key":"14_CR36","series-title":"Cryptology","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49530-9","volume-title":"Feistel Ciphers - Security Proofs and Cryptanalysis","author":"V Nachef","year":"2017","unstructured":"Nachef, V., Patarin, J., Volte, E.: Feistel Ciphers - Security Proofs and Cryptanalysis. Cryptology, Springer, Cham (2017)"},{"key":"14_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-662-48800-3_5","volume-title":"Advances in Cryptology","author":"M Nandi","year":"2015","unstructured":"Nandi, M.: On the optimality of non-linear computations of length-preserving encryption schemes. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 113\u2013133. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_5"},{"issue":"1","key":"14_CR38","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. Cryptol. 12(1), 29\u201366 (1999)","journal-title":"J. Cryptol."},{"key":"14_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-540-28628-8_7","volume-title":"Advances in Cryptology","author":"J Patarin","year":"2004","unstructured":"Patarin, J.: Security of Random Feistel Schemes with 5 or More Rounds. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 106\u2013122. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_7"},{"key":"14_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-04159-4","volume-title":"Selected Areas in Cryptography","author":"J Patarin","year":"2009","unstructured":"Patarin, J.: The \u201ccoefficients H\u2019\u2019 technique (invited talk). 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"},{"key":"14_CR41","unstructured":"Patarin, J.: Security of balanced and unbalanced Feistel schemes with linear non equalities. Cryptology ePrint Archive, Report 2010\/293 (2010). http:\/\/eprint.iacr.org\/2010\/293"},{"key":"14_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-76900-2_20","volume-title":"Advances in Cryptology","author":"J Patarin","year":"2007","unstructured":"Patarin, J., Nachef, V., Berbain, C.: Generic attacks on unbalanced Feistel schemes with expanding functions. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 325\u2013341. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76900-2_20"},{"key":"14_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/3-540-47555-9_23","volume-title":"Advances in Cryptology","author":"B Sadeghiyan","year":"1993","unstructured":"Sadeghiyan, B., Pieprzyk, J.: A construction for super pseudorandom permutations from a single pseudorandom function. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 267\u2013284. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-47555-9_23"},{"key":"14_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-60865-6_49","volume-title":"Fast Software Encryption","author":"B Schneier","year":"1996","unstructured":"Schneier, B., Kelsey, J.: Unbalanced Feistel networks and block cipher design. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 121\u2013144. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60865-6_49"},{"issue":"1","key":"14_CR45","doi-asserted-by":"publisher","first-page":"425","DOI":"10.46586\/tosc.v2020.i1.425-457","volume":"2020","author":"Y Shen","year":"2020","unstructured":"Shen, Y., Guo, C., Wang, L.: Improved security bounds for generalized Feistel networks. IACR Trans. Symm. Cryptol. 2020(1), 425\u2013457 (2020)","journal-title":"IACR Trans. Symm. Cryptol."},{"key":"14_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-17373-8_6","volume-title":"Advances in Cryptology","author":"E Volte","year":"2010","unstructured":"Volte, E., Nachef, V., Patarin, J.: Improved generic attacks on unbalanced Feistel schemes with expanding functions. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 94\u2013111. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_6"},{"key":"14_CR47","doi-asserted-by":"crossref","unstructured":"Yu, W., Zhao, Y., Guo, C.: Provable Related-key Security of Contracting Feistel Networks. In: Inscrypt 2020 (to appear, 2020)","DOI":"10.1007\/978-3-030-71852-7_31"},{"key":"14_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/0-387-34805-0_42","volume-title":"Advances in Cryptology","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. 435, pp. 461\u2013480. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_42"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75539-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:06:45Z","timestamp":1710263205000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75539-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030755386","9783030755393"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75539-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CT-RSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cryptographers\u2019 Track at the RSA Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Francisco, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ctrsa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/site\/ctrsa2021\/","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":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","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":"27","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":"27% - 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.25","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":"8","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)"}},{"value":"The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}