{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:39:55Z","timestamp":1742938795470,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031562310"},{"type":"electronic","value":"9783031562327"}],"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-56232-7_6","type":"book-chapter","created":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T14:02:34Z","timestamp":1711634554000},"page":"111-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Minimizing Tweakable Blockcipher-Based Generalized Feistel Networks"],"prefix":"10.1007","author":[{"given":"Yuqing","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,29]]},"reference":[{"key":"6_CR1","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":"6_CR2","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., et al.: The SKINNY family of block ciphers and its low-latency variant MANTIS. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part II. LNCS, vol. 9815, pp. 123\u2013153. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_5"},{"key":"6_CR3","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":"7","key":"6_CR4","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1109\/TC.2015.2468218","volume":"65","author":"TP Berger","year":"2016","unstructured":"Berger, T.P., Francq, J., Minier, M., Thomas, G.: Extended generalized feistel networks using matrix representation to propose a new lightweight block cipher: lilliput. IEEE Trans. Comput. 65(7), 2074\u20132089 (2016). https:\/\/doi.org\/10.1109\/TC.2015.2468218","journal-title":"IEEE Trans. Comput."},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-030-03326-2_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"R Bhaumik","year":"2018","unstructured":"Bhaumik, R., List, E., Nandi, M.: ZCZ \u2013 achieving n-bit SPRP security with a minimal number of tweakable-block-cipher calls. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018, Part I. LNCS, vol. 11272, pp. 336\u2013366. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_12"},{"key":"6_CR6","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 \u2014 CT-RSA 2002","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":"6_CR7","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":"6_CR8","doi-asserted-by":"publisher","unstructured":"Chen, Y.L., Luykx, A., Mennink, B., Preneel, B.: Efficient length doubling from tweakable block ciphers. IACR Trans. Symmetric Cryptol. 2017(3), 253\u2013270 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i3.253-270","DOI":"10.13154\/tosc.v2017.i3.253-270"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-030-03326-2_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"YL Chen","year":"2018","unstructured":"Chen, Y.L., Mennink, B., Nandi, M.: Short variable length domain extenders with beyond birthday bound security. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018, Part I. LNCS, vol. 11272, pp. 244\u2013274. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_9"},{"key":"6_CR10","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":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-030-05378-9_3","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2018","author":"A Dutta","year":"2018","unstructured":"Dutta, A., Nandi, M.: Tweakable HCTR: a BBB secure tweakable enciphering scheme. In: Chakraborty, D., Iwata, T. (eds.) INDOCRYPT 2018. LNCS, vol. 11356, pp. 47\u201369. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-05378-9_3"},{"issue":"11","key":"6_CR12","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"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-662-53887-6_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"S Gueron","year":"2016","unstructured":"Gueron, S., Mouha, N.: Simpira\u00a0v2: a family of efficient permutations using the AES round function. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016, Part I. LNCS, vol. 10031, pp. 95\u2013125. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_4"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Guo, C., Standaert, F., Wang, W., Wang, X., Yu, Y.: Provable security of SP networks with partial non-linear layers. IACR Trans. Symmetric Cryptol. 2021(2), 353\u2013388 (2021). https:\/\/doi.org\/10.46586\/tosc.v2021.i2.353-388","DOI":"10.46586\/tosc.v2021.i2.353-388"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-662-46800-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"VT Hoang","year":"2015","unstructured":"Hoang, V.T., Krovetz, T., Rogaway, P.: Robust authenticated-encryption AEZ and the problem that it solves. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part I. LNCS, vol. 9056, pp. 15\u201344. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_2"},{"key":"6_CR16","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"},{"issue":"3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00145-021-09397-w","volume":"34","author":"J Jean","year":"2021","unstructured":"Jean, J., Nikolic, I., Peyrin, T., Seurin, Y.: The deoxys AEAD family. J. Cryptol. 34(3), 31 (2021). https:\/\/doi.org\/10.1007\/s00145-021-09397-w","journal-title":"J. Cryptol."},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-030-25283-0_12","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2017","author":"A Jha","year":"2019","unstructured":"Jha, A., List, E., Minematsu, K., Mishra, S., Nandi, M.: XHX \u2013 a framework for optimally secure tweakable block ciphers from classical block ciphers and universal hashing. In: Lange, T., Dunkelman, O. (eds.) LATINCRYPT 2017. LNCS, vol. 11368, pp. 207\u2013227. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25283-0_12"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-45708-9_3","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"M Liskov","year":"2002","unstructured":"Liskov, M., Rivest, R.L., Wagner, D.: Tweakable block ciphers. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 31\u201346. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_3"},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/s00145-010-9073-y","volume":"24","author":"M Liskov","year":"2011","unstructured":"Liskov, M., Rivest, R.L., Wagner, D.: Tweakable block ciphers. J. Cryptol. 24(3), 588\u2013613 (2011). https:\/\/doi.org\/10.1007\/s00145-010-9073-y","journal-title":"J. Cryptol."},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Liskov, M.D., Rivest, R.L., Wagner, D.A.: Tweakable block ciphers. In: Yung, M. (eds.) CRYPTO 2002. LNCS, vol. 2442, pp. 31\u201346. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_3. https:\/\/api.semanticscholar.org\/CorpusID:126254492","DOI":"10.1007\/3-540-45708-9_3"},{"issue":"2","key":"6_CR22","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":"6_CR23","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"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-642-03317-9_19","volume-title":"Fast Software Encryption","author":"K Minematsu","year":"2009","unstructured":"Minematsu, K.: Beyond-birthday-bound security based on tweakable block cipher. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol. 5665, pp. 308\u2013326. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03317-9_19"},{"issue":"3","key":"6_CR25","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s10623-013-9882-8","volume":"74","author":"K Minematsu","year":"2015","unstructured":"Minematsu, K.: Building blockcipher from small-block tweakable blockcipher. Des. Codes Cryptogr. 74(3), 645\u2013663 (2015). https:\/\/doi.org\/10.1007\/s10623-013-9882-8","journal-title":"Des. Codes Cryptogr."},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-642-25516-8_24","volume-title":"Cryptography and Coding","author":"K Minematsu","year":"2011","unstructured":"Minematsu, K., Iwata, T.: Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal. In: Chen, L. (ed.) IMACC 2011. LNCS, vol. 7089, pp. 391\u2013412. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25516-8_24"},{"key":"6_CR27","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 - CRYPTO 2009","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":"6_CR28","doi-asserted-by":"publisher","unstructured":"Nakamichi, R., Iwata, T.: Iterative block ciphers from tweakable block ciphers with long tweaks. IACR Trans. Symm. Cryptol. 2019(4), 54\u201380 (2019). https:\/\/doi.org\/10.13154\/tosc.v2019.i4.54-80","DOI":"10.13154\/tosc.v2019.i4.54-80"},{"key":"6_CR29","doi-asserted-by":"publisher","unstructured":"Nakamichi, R., Iwata, T.: Beyond-birthday-bound secure cryptographic permutations from ideal ciphers with long keys. IACR Trans. Symm. Cryptol. 2020(2), 68\u201392 (2020). https:\/\/doi.org\/10.13154\/tosc.v2020.i2.68-92","DOI":"10.13154\/tosc.v2020.i2.68-92"},{"key":"6_CR30","doi-asserted-by":"publisher","unstructured":"Nakaya, K., Iwata, T.: Generalized feistel structures based on tweakable block ciphers. IACR Trans. Symmetric Cryptol. 2022(4), 24\u201391 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i4.24-91","DOI":"10.46586\/tosc.v2022.i4.24-91"},{"key":"6_CR31","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 \u2013 ASIACRYPT 2015","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, Part II. LNCS, vol. 9453, pp. 113\u2013133. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_5"},{"issue":"1","key":"6_CR32","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). https:\/\/doi.org\/10.1007\/PL00003817","journal-title":"J. Cryptol."},{"key":"6_CR33","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 \u2013 CRYPTO 2004","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":"6_CR34","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"},{"key":"6_CR35","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 \u2014 EUROCRYPT\u2019 92","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":"6_CR36","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"},{"key":"6_CR37","doi-asserted-by":"publisher","unstructured":"Shen, Y., Guo, C., Wang, L.: Improved security bounds for generalized Feistel networks. IACR Trans. Symm. Cryptol. 2020(1), 425\u2013457 (2020). https:\/\/doi.org\/10.13154\/tosc.v2020.i1.425-457","DOI":"10.13154\/tosc.v2020.i1.425-457"},{"key":"6_CR38","doi-asserted-by":"publisher","unstructured":"Shen, Y., Standaert, F.: Optimally secure tweakable block ciphers with a large tweak from n-bit block ciphers. IACR Trans. Symmetric Cryptol. 2023(2), 47\u201368 (2023). https:\/\/doi.org\/10.46586\/tosc.v2023.i2.47-68","DOI":"10.46586\/tosc.v2023.i2.47-68"},{"key":"6_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-42033-7_21","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"T Shrimpton","year":"2013","unstructured":"Shrimpton, T., Terashima, R.S.: A modular framework for building variable-input-length tweakable ciphers. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part I. LNCS, vol. 8269, pp. 405\u2013423. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42033-7_21"},{"key":"6_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-35999-6_22","volume-title":"Selected Areas in Cryptography","author":"T Suzaki","year":"2013","unstructured":"Suzaki, T., Minematsu, K., Morioka, S., Kobayashi, E.: TWINE: a lightweight block cipher for multiple platforms. In: Knudsen, L.R., Wu, H. (eds.) SAC 2012. LNCS, vol. 7707, pp. 339\u2013354. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35999-6_22"},{"key":"6_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-21554-4_19","volume-title":"Applied Cryptography and Network Security","author":"W Wu","year":"2011","unstructured":"Wu, W., Zhang, L.: LBlock: a lightweight block cipher. In: Lopez, J., Tsudik, G. (eds.) ACNS 2011. LNCS, vol. 6715, pp. 327\u2013344. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21554-4_19"},{"key":"6_CR42","unstructured":"Zhao, Y., Guo, C., Wang, W.: Towards Minimizing Non-linearity in Type-II Generalized Feistel Networks. Cryptology ePrint Archive, Report 2023\/1295 (2023). https:\/\/eprint.iacr.org\/2023\/1295. To appear at CANS 2023"},{"key":"6_CR43","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 \u2014 CRYPTO\u2019 89 Proceedings","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","Progress in Cryptology \u2013 INDOCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56232-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T14:06:09Z","timestamp":1711634769000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56232-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031562310","9783031562327"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56232-7_6","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":"29 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Goa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2023","order":10,"name":"conference_id","label":"Conference ID","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"74","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":"36% - 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":"4","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)"}}]}}