{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:29:29Z","timestamp":1740180569836,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62022036","62132008","62372213","62202460"],"award-info":[{"award-number":["62022036","62132008","62372213","62202460"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The Generalized Feistel Structure (<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\texttt{GFS}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>GFS<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>) is one of the most widely used frameworks in symmetric cipher design. In FES 2010, Suzaki and Minematsu strengthened the cryptanalysis security of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\texttt{GFS}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>GFS<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> by searching for shuffles with the best diffusion property. In ASIACRYPT 2018, Shi\u00a0et al.\u00a0suggested a set of shuffles, which makes <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\texttt{GFS}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>GFS<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> a better resistance against Demirci\u2013Selcuk meet-in-the-middle cryptanalysis. Since these shuffles are different from the currently known good ones and also different from the shuffles used in <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\texttt{TWINE}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>TWINE<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\texttt{LBlock}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>LBlock<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, our research focuses on a more comprehensive evaluation of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\texttt{GFS}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>GFS<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> with different shuffles, including diffusion property of shuffle, differential, linear, impossible differential, zero-correlation linear, integral and Demirci\u2013Selcuk meet-in-the-middle cryptanalysis, to find the best one. Such evaluations entail significant time consumption. Thus, we utilize Mixed Integral Linear Programming models and introduce an evaluate-and-filter strategy to achieve it efficiently. Our results verify that the shuffles discovered by Suzaki and Minematsu and those used in <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\texttt{TWINE}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>TWINE<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\texttt{LBlock}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>LBlock<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> are the best so far. We also find that the cryptanalysis resistances of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\texttt{GFS}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>GFS<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> are not necessarily consistent. It is this finding that makes the necessity of our more comprehensive evaluation self-evident.<\/jats:p>","DOI":"10.1186\/s42400-024-00220-0","type":"journal-article","created":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T02:02:13Z","timestamp":1730426533000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting the shuffle of generalized Feistel structure"],"prefix":"10.1186","volume":"7","author":[{"given":"Yincen","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuanyu","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qianqian","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,1]]},"reference":[{"key":"220_CR1","doi-asserted-by":"crossref","unstructured":"Anderson R, Biham E (1996) Two practical and provably secure block ciphers: bear and lion. In: Fast software encryption: third international workshop Cambridge, UK, February 21\u201323 1996 Proceedings 3. Springer, pp 113\u2013120","DOI":"10.1007\/3-540-60865-6_48"},{"key":"220_CR2","doi-asserted-by":"crossref","unstructured":"Baicheva T, Topalova S (2019) On the diffusion property of the improved generalized feistel with different permutations for each round. In: International conference on algebraic informatics. Springer, pp 38\u201349","DOI":"10.1007\/978-3-030-21363-3_4"},{"key":"220_CR3","doi-asserted-by":"crossref","unstructured":"Beierle C, Jean J, K\u00f6lbl S, Leander G, Moradi A, Peyrin T, Sasaki Y, Sasdrich P, Sim SM (2016) The skinny family of block ciphers and its low-latency variant mantis. In: Advances in cryptology-CRYPTO 2016: 36th annual international cryptology conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part II 36. Springer, pp 123\u2013153","DOI":"10.1007\/978-3-662-53008-5_5"},{"issue":"1","key":"220_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF00630563","volume":"4","author":"E Biham","year":"1991","unstructured":"Biham E, Shamir A (1991) Differential cryptanalysis of DES-like cryptosystems. J Cryptol 4(1):3\u201372","journal-title":"J Cryptol"},{"key":"220_CR5","doi-asserted-by":"crossref","unstructured":"Biham E, Biryukov A, Shamir A (1999a) Cryptanalysis of skipjack reduced to 31 rounds using impossible differentials. In: Advances in cryptology-EUROCRYPT\u201999: international conference on the theory and application of cryptographic techniques Prague, Czech Republic, May 2\u20136, 1999 Proceedings 18. Springer, pp 12\u201323","DOI":"10.1007\/3-540-48910-X_2"},{"key":"220_CR6","doi-asserted-by":"crossref","unstructured":"Biham E, Biryukov A, Shamir A (1999b) Miss in the middle attacks on idea and khufu. In: Fast software encryption: 6th international workshop, FSE\u201999 Rome, Italy, March 24\u201326, 1999 Proceedings 6. Springer, pp 124\u2013138","DOI":"10.1007\/3-540-48519-8_10"},{"key":"220_CR7","doi-asserted-by":"crossref","unstructured":"Biryukov A, Shamir A (2001) Structural cryptanalysis of sasas. In: Advances in cryptology-EUROCRYPT 2001: international conference on the theory and application of cryptographic techniques Innsbruck, Austria, May 6\u201310, 2001 Proceedings 20. Springer, pp 395\u2013405","DOI":"10.1007\/3-540-44987-6_24"},{"key":"220_CR8","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10623-012-9697-z","volume":"70","author":"A Bogdanov","year":"2014","unstructured":"Bogdanov A, Rijmen V (2014) Linear hulls with correlation zero and linear cryptanalysis of block ciphers. Des Codes Crypt 70:369\u2013383","journal-title":"Des Codes Crypt"},{"key":"220_CR9","doi-asserted-by":"crossref","unstructured":"Cauchois V, Gomez C, Thomas G (2019) General diffusion analysis: how to find optimal permutations for generalized type-II feistel schemes. IACR Transactions on Symmetric Cryptology, 264\u2013301","DOI":"10.46586\/tosc.v2019.i1.264-301"},{"key":"220_CR10","unstructured":"Cui T, Chen S, Jia K, Fu K, Wang M (2016) New automatic search tool for impossible differentials and zero-correlation linear approximations. Cryptology ePrint Archive"},{"key":"#cr-split#-220_CR11.1","doi-asserted-by":"crossref","unstructured":"Daemen J, Knudsen LR, Rijmen V (1997) The block cipher Square. In: Biham E","DOI":"10.1007\/BFb0052343"},{"key":"#cr-split#-220_CR11.2","doi-asserted-by":"crossref","unstructured":"(ed) Fast software encryption, 4th international workshop, FSE '97, Haifa, Israel, January 20-22, 1997, Proceedings. Lecture notes in computer science, vol 1267. Springer, pp 149-165. https:\/\/doi.org\/10.1007\/BFb0052343","DOI":"10.1007\/BFb0052343"},{"key":"220_CR12","doi-asserted-by":"crossref","unstructured":"Daemen J, Rijmen V (2001) The wide trail design strategy. In: Cryptography and coding: 8th IMA international conference Cirencester, UK, December 17\u201319, 2001 Proceedings 8. Springer, pp 222\u2013238","DOI":"10.1007\/3-540-45325-3_20"},{"key":"220_CR13","doi-asserted-by":"crossref","unstructured":"Delaune S, Derbez P, Gontier A, Prud\u2019homme C (2022) New algorithm for exhausting optimal permutations for generalized feistel networks. In: International conference on cryptology in India. Springer, pp 103\u2013124","DOI":"10.1007\/978-3-031-22912-1_5"},{"key":"220_CR14","doi-asserted-by":"crossref","unstructured":"Demirci H, Sel\u00e7uk AA (2008) A meet-in-the-middle attack on 8-round aes. In: Fast software encryption: 15th international workshop, FSE 2008, Lausanne, Switzerland, February 10\u201313, 2008, Revised Selected Papers 15. Springer, pp 116\u2013126","DOI":"10.1007\/978-3-540-71039-4_7"},{"key":"220_CR15","doi-asserted-by":"publisher","first-page":"218","DOI":"10.46586\/tosc.v2019.i2.218-240","volume":"2019","author":"P Derbez","year":"2019","unstructured":"Derbez P, Fouque P-A, Lambin B, Mollimard V (2019) Efficient search for optimal diffusion layers of generalized feistel networks. IACR Trans Symmetr Cryptol 2019:218\u2013240","journal-title":"IACR Trans Symmetr Cryptol"},{"key":"220_CR16","doi-asserted-by":"crossref","unstructured":"Kim J, Hong S, Sung J, Lee S, Lim J, Sung S (2003) Impossible differential cryptanalysis for block cipher structures. In: Progress in cryptology-INDOCRYPT 2003: 4th international conference on cryptology in India, New Delhi, India, December 8\u201310, 2003. Proceedings 4. Springer, pp 82\u201396","DOI":"10.1007\/978-3-540-24582-7_6"},{"key":"220_CR17","doi-asserted-by":"crossref","unstructured":"Knudsen L, Wagner D (2002) Integral cryptanalysis. In: Fast software encryption: 9th international workshop, FSE 2002 Leuven, Belgium, February 4\u20136, 2002 Revised Papers 9. Springer, pp 112\u2013127","DOI":"10.1007\/3-540-45661-9_9"},{"key":"220_CR18","doi-asserted-by":"crossref","unstructured":"Lucks S (1996) Faster Luby-Rackoff ciphers. In: International workshop on fast software encryption. Springer, pp 189\u2013203","DOI":"10.1007\/3-540-60865-6_53"},{"key":"220_CR19","doi-asserted-by":"crossref","unstructured":"Lucks S (2001) The saturation attack-a bait for twofish. In: International workshop on fast software encryption. Springer, pp 1\u201315","DOI":"10.1007\/3-540-45473-X_1"},{"key":"220_CR20","doi-asserted-by":"crossref","unstructured":"Matsui M (1993) Linear cryptanalysis method for des cipher. In: Workshop on the theory and application of of cryptographic techniques. Springer, pp 386\u2013397","DOI":"10.1007\/3-540-48285-7_33"},{"key":"220_CR21","doi-asserted-by":"crossref","unstructured":"Matsui M (1995) On correlation between the order of s-boxes and the strength of des. In: Advances in cryptology-EUROCRYPT\u201994: workshop on the theory and application of cryptographic techniques Perugia, Italy, May 9\u201312, 1994 Proceedings 13. Springer, pp 366\u2013375","DOI":"10.1007\/BFb0053451"},{"key":"220_CR22","doi-asserted-by":"crossref","unstructured":"Mouha N, Wang Q, Gu D, Preneel B (2012) Differential and linear cryptanalysis using mixed-integer linear programming. In: Information security and cryptology: 7th international conference, Inscrypt 2011, Beijing, China, November 30\u2013December 3, 2011. Revised Selected Papers 7. Springer, pp 57\u201376","DOI":"10.1007\/978-3-642-34704-7_5"},{"key":"220_CR23","doi-asserted-by":"crossref","unstructured":"Nyberg K (1996) Generalized feistel networks. In: International conference on the theory and application of cryptology and information security. Springer, pp 91\u2013104","DOI":"10.1007\/BFb0034838"},{"key":"220_CR24","doi-asserted-by":"crossref","unstructured":"Sajadieh M, Vaziri M (2018) Using milp in analysis of feistel structures and improving type II gfs by switching mechanism. In: International conference on cryptology in India. Springer, pp 265\u2013281","DOI":"10.1007\/978-3-030-05378-9_15"},{"key":"220_CR25","doi-asserted-by":"crossref","unstructured":"Sasaki Y, Todo Y (2017) New impossible differential search tool from design and cryptanalysis aspects: revealing structural properties of several ciphers. In: Advances in cryptology-EUROCRYPT 2017: 36th annual international conference on the theory and applications of cryptographic techniques, Paris, France, April 30\u2013May 4, 2017, Proceedings, Part III 36. Springer, pp 185\u2013215","DOI":"10.1007\/978-3-319-56617-7_7"},{"key":"220_CR26","doi-asserted-by":"crossref","unstructured":"Schneier B, Kelsey J (1996) Unbalanced feistel networks and block cipher design. In: International workshop on fast software encryption. Springer, pp 121\u2013144","DOI":"10.1007\/3-540-60865-6_49"},{"key":"220_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106197","volume":"174","author":"K Shibutani","year":"2022","unstructured":"Shibutani K, Iwata T (2022) On the (im) possibility of improving the round diffusion of generalized feistel structures. Inf Process Lett 174:106197","journal-title":"Inf Process Lett"},{"key":"220_CR28","doi-asserted-by":"crossref","unstructured":"Shi D, Sun S, Derbez P, Todo Y, Sun B, Hu L (2018) Programming the Demirci\u2013Sel\u00e7uk meet-in-the-middle attack with constraints. In: International conference on the theory and application of cryptology and information security. Springer, pp 3\u201334","DOI":"10.1007\/978-3-030-03329-3_1"},{"key":"220_CR29","unstructured":"Standard DE et al (1977) Federal information processing standards publication 46. National Bureau of Standards, US Department of Commerce, vol 23, pp 1\u201318"},{"key":"220_CR30","unstructured":"Sun S, Hu L, Wang M, Wang P, Qiao K, Ma X, Shi D, Song L, Fu K (2014) Towards finding the best characteristics of some bit-oriented block ciphers and automatic enumeration of (related-key) differential and linear characteristics with predefined properties. Cryptology ePrint Archive"},{"key":"220_CR31","doi-asserted-by":"crossref","unstructured":"Suzaki T, Minematsu K (2010) Improving the generalized feistel. In: Fast software encryption: 17th international workshop, FSE 2010, Seoul, Korea, February 7\u201310, 2010, Revised Selected Papers 17. Springer, pp 19\u201339","DOI":"10.1007\/978-3-642-13858-4_2"},{"key":"220_CR32","unstructured":"Suzaki T, Minematsu K, Morioka S, Kobayashi E (2011) Twine: a lightweight, versatile block cipher. In: ECRYPT workshop on lightweight cryptography, vol 2011. Springer, Berlin"},{"key":"220_CR33","doi-asserted-by":"crossref","unstructured":"Todo Y (2015) Integral cryptanalysis on full MISTY1. In: Gennaro R, Robshaw M (eds) Advances in cryptology-CRYPTO 2015-35th annual cryptology conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part I. Lecture notes in computer science, vol 9215. Springer, pp 413\u2013432. https:\/\/doi.org\/10.1007\/978-3-662-47989-6_20","DOI":"10.1007\/978-3-662-47989-6_20"},{"key":"220_CR34","doi-asserted-by":"crossref","unstructured":"Todo Y (2015a) Structural evaluation by generalized integral property. In: Oswald E, Fischlin M (eds) Advances in cryptology-EUROCRYPT 2015-34th annual international conference on the theory and applications of cryptographic techniques, Sofia, Bulgaria, April 26\u201330, 2015, Proceedings, Part I. Lecture notes in computer science, vol 9056. Springer, pp 287\u2013314. https:\/\/doi.org\/10.1007\/978-3-662-46800-5_12","DOI":"10.1007\/978-3-662-46800-5_12"},{"key":"220_CR35","doi-asserted-by":"crossref","unstructured":"Todo Y (2015b) Structural evaluation by generalized integral property. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, pp 287\u2013314","DOI":"10.1007\/978-3-662-46800-5_12"},{"key":"#cr-split#-220_CR36.1","doi-asserted-by":"crossref","unstructured":"Todo Y, Morii M (2016) Bit-based division property and application to Simon family. In: Peyrin T","DOI":"10.1007\/978-3-662-52993-5_18"},{"key":"#cr-split#-220_CR36.2","doi-asserted-by":"crossref","unstructured":"(ed) Fast software encryption-23rd international conference, FSE 2016, Bochum, Germany, March 20-23, 2016, Revised Selected Papers. Lecture notes in computer science, vol 9783. Springer, pp 357-377. https:\/\/doi.org\/10.1007\/978-3-662-52993-5_18","DOI":"10.1007\/978-3-662-52993-5_18"},{"key":"220_CR37","doi-asserted-by":"crossref","unstructured":"Wu W, Zhang L (2011) Lblock: a lightweight block cipher. In: Applied cryptography and network security: 9th international conference, ACNS 2011, Nerja, Spain, June 7\u201310, 2011. Proceedings 9. Springer, pp 327\u2013344","DOI":"10.1007\/978-3-642-21554-4_19"},{"key":"220_CR38","doi-asserted-by":"crossref","unstructured":"Xiang Z, Zhang W, Bao Z, Lin D (2016) Applying milp method to searching integral distinguishers based on division property for 6 lightweight block ciphers. In: Advances in cryptology-ASIACRYPT 2016: 22nd international conference on the theory and application of cryptology and information security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part I 22. Springer, pp 648\u2013678","DOI":"10.1007\/978-3-662-53887-6_24"},{"key":"220_CR39","doi-asserted-by":"crossref","unstructured":"Xiang Z, Zhang W, Bao Z, Lin D (2016) Applying MILP method to searching integral distinguishers based on division property for 6 lightweight block ciphers. In: Cheon JH, Takagi T (eds) Advances in cryptology-ASIACRYPT 2016-22nd international conference on the theory and application of cryptology and information security, Hanoi, Vietnam, December 4\u20138, 2016, Proceedings, Part I. Lecture notes in computer science, vol 10031, pp 648\u2013678. https:\/\/doi.org\/10.1007\/978-3-662-53887-6_24","DOI":"10.1007\/978-3-662-53887-6_24"},{"key":"220_CR40","doi-asserted-by":"crossref","unstructured":"Zheng Y, Matsumoto T, Imai H (1990) On the construction of block ciphers provably secure and not relying on any unproved hypotheses. In: Advances in cryptology-CRYPTO\u201989 Proceedings 9. Springer, pp 461\u2013480","DOI":"10.1007\/0-387-34805-0_42"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00220-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-024-00220-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00220-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T02:03:50Z","timestamp":1730426630000},"score":1,"resource":{"primary":{"URL":"https:\/\/cybersecurity.springeropen.com\/articles\/10.1186\/s42400-024-00220-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,1]]},"references-count":42,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["220"],"URL":"https:\/\/doi.org\/10.1186\/s42400-024-00220-0","relation":{},"ISSN":["2523-3246"],"issn-type":[{"type":"electronic","value":"2523-3246"}],"subject":[],"published":{"date-parts":[[2024,11,1]]},"assertion":[{"value":"8 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"31"}}