{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T09:03:32Z","timestamp":1768208612216,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T00:00:00Z","timestamp":1768176000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T00:00:00Z","timestamp":1768176000000},"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":["62102448, 62202493"],"award-info":[{"award-number":["62102448, 62202493"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Cryptologic Science Fund of China","award":["Grant No. 2025NCSF2024"],"award-info":[{"award-number":["Grant No. 2025NCSF2024"]}]},{"name":"National Key Research and Development Program of China","award":["2024YFB4504900"],"award-info":[{"award-number":["2024YFB4504900"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Boomerang attack serves as a potent cryptanalytic tool for assessing the security of block ciphers. Over the past few years, various automatic search models for boomerang distinguishers have been proposed for block ciphers with different structures. This paper presents improved Mixed-Integer Linear Programming (MILP)-based search models for both single-key and related-key boomerang distinguishers. In the single-key scenario, we propose a method for dynamic allocation of active S-boxes. Our search model for single-key boomerang distinguishers characterizes the distinguisher probability more accurately, addressing the suboptimality issue caused by non-fixed weight assignments in prior models. In the related-key scenario, a search model for related-key boomerang distinguisher is proposed for block ciphers with bit-level key schedule algorithms, where the probability of the boomerang switch is ensured to be 1. To validate the effectiveness of our models, we apply them to the lightweight block cipher LILLIPUT based on Extended Generalized Feistel Networks (EGFN), conducting a comprehensive security analysis against boomerang attacks. Using our models, we successfully derive single-key boomerang distinguishers for 8 to 13 rounds and a 15-round related-key boomerang distinguisher. Notably, the data complexity required for 13-round single-key distinguishing attack is reduced by\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$${2^{ 3.172}}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msup>\n                            <mml:mn>2<\/mml:mn>\n                            <mml:mrow>\n                              <mml:mn>3.172<\/mml:mn>\n                            <\/mml:mrow>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , and the 15-round related-key boomerang distinguisher with a probability of\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$${2^{ - 58}}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msup>\n                            <mml:mn>2<\/mml:mn>\n                            <mml:mrow>\n                              <mml:mo>-<\/mml:mo>\n                              <mml:mn>58<\/mml:mn>\n                            <\/mml:mrow>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    is currently the longest-round distinguisher among all known distinguishers for LILLIPUT. The application results fully demonstrate the capability of our models in evaluating the security of block ciphers. This research not only provides new insights and methods for the design and analysis of lightweight block ciphers, but also deepens the understanding of the security characteristics for LILLIPUT.\n                  <\/jats:p>","DOI":"10.1186\/s42400-025-00540-9","type":"journal-article","created":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T05:56:54Z","timestamp":1768197414000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved search models of boomerang distinguishers and application to LILLIPUT"],"prefix":"10.1186","volume":"9","author":[{"given":"Yunong","family":"Wu","sequence":"first","affiliation":[]},{"given":"Yanyan","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Zongsheng","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Tairong","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2306-3720","authenticated-orcid":false,"given":"Senpeng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,12]]},"reference":[{"issue":"7","key":"540_CR1","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1109\/TC.2015.2468218","volume":"65","author":"TP Berger","year":"2016","unstructured":"Berger TP, Francq J, Minier M et al (2016) Extended generalized feistel networks using matrix representation to propose a new lightweight block cipher: lilliput. IEEE Trans Comput 65(7):2074\u20132089. https:\/\/doi.org\/10.1109\/TC.2015.2468218","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"540_CR2","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. https:\/\/doi.org\/10.1007\/BF00630563","journal-title":"J Cryptol"},{"key":"540_CR3","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/3-540-44987-6_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2001","author":"E Biham","year":"2001","unstructured":"Biham E, Dunkelman O, Keller N (2001) The rectangle attack \u2013 rectangling the serpent. In: Pfitzmann B (ed) Advances in Cryptology \u2013 EUROCRYPT 2001. Springer, Berlin Heidelberg, Berlin, Heidelberg, pp 340\u2013357"},{"issue":"1","key":"540_CR4","doi-asserted-by":"publisher","first-page":"331","DOI":"10.13154\/tosc.v2020.i1.331-362","volume":"2020","author":"H Boukerrou","year":"2020","unstructured":"Boukerrou H, Huynh P, Lallemand V et al (2020) On the feistel counterpart of the boomerang connectivity table: introduction and analysis of the fbct. IACR Trans Symmet Cryptol 2020(1):331\u2013362. https:\/\/doi.org\/10.13154\/tosc.v2020.i1.331-362 (https:\/\/tosc.iacr.org\/index.php\/ToSC\/article\/view\/8568)","journal-title":"IACR Trans Symmet Cryptol"},{"key":"540_CR5","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/978-3-319-78375-8_22","volume-title":"Advances in cryptology - EUROCRYPT 2018","author":"C Cid","year":"2018","unstructured":"Cid C, Huang T, Peyrin T et al (2018) Boomerang connectivity table: a new cryptanalysis tool. In: Nielsen JB, Rijmen V (eds) Advances in cryptology - EUROCRYPT 2018. Springer International Publishing, Cham, pp 683\u2013714"},{"key":"540_CR6","doi-asserted-by":"publisher","first-page":"104","DOI":"10.46586\/tosc.v2020.i4.104-129","volume":"4","author":"S Delaune","year":"2020","unstructured":"Delaune S, Derbez P, Vavrille M (2020) Catching the fastest boomerangs: application to skinny. IACR Trans Symmet Cryptol 4:104\u2013129. https:\/\/doi.org\/10.46586\/tosc.v2020.i4.104-129 (https:\/\/tosc.iacr.org\/index.php\/ToSC\/article\/view\/8750)","journal-title":"IACR Trans Symmet Cryptol"},{"key":"540_CR7","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-642-14623-7_21","volume-title":"Advances in cryptology - CRYPTO 2010","author":"O Dunkelman","year":"2010","unstructured":"Dunkelman O, Keller N, Shamir A (2010) A practical-time related-key attack on the kasumi cryptosystem used in gsm and 3g telephony. In: Rabin T (ed) Advances in cryptology - CRYPTO 2010. Springer, Berlin Heidelberg, Berlin, Heidelberg, pp 393\u2013410"},{"key":"540_CR8","doi-asserted-by":"publisher","first-page":"140","DOI":"10.46586\/tosc.v2021.i2.140-198","volume":"2","author":"H Hadipour","year":"2021","unstructured":"Hadipour H, Bagheri N, Song L (2021) Improved rectangle attacks on skinny and craft. IACR Trans Symmet Cryptol 2:140\u2013198. https:\/\/doi.org\/10.46586\/tosc.v2021.i2.140-198 (https:\/\/tosc.iacr.org\/index.php\/ToSC\/article\/view\/8908)","journal-title":"IACR Trans Symmet Cryptol"},{"key":"540_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.46586\/tosc.v2022.i3.271-302","volume":"3","author":"H Hadipour","year":"2022","unstructured":"Hadipour H, Nageler M, Eichlseder M (2022) Throwing boomerangs into feistel structures: application to clefia, warp, lblock, lblock-s and twine. IACR Transac Symmet Cryptol 3:271\u2013302. https:\/\/doi.org\/10.46586\/tosc.v2022.i3.271-302 (https:\/\/tosc.iacr.org\/index.php\/ToSC\/article\/view\/9858)","journal-title":"IACR Transac Symmet Cryptol"},{"key":"540_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-44706-7_6","volume-title":"Fast software encryption","author":"J Kelsey","year":"2001","unstructured":"Kelsey J, Kohno T, Schneier B (2001) Amplified boomerang attacks against reduced-round mars and serpent. In: Goos G, Hartmanis J, van Leeuwen J et al (eds) Fast software encryption. Springer, Berlin Heidelberg, Berlin, Heidelberg, pp 75\u201393"},{"key":"540_CR11","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-319-93638-3_12","volume-title":"Information security and privacy","author":"N Marri\u00e8re","year":"2018","unstructured":"Marri\u00e8re N, Nachef V, Volte E (2018) Differential attacks on reduced round lilliput. In: Susilo W, Yang G (eds) Information security and privacy. Springer International Publishing, Cham, pp 188\u2013206"},{"issue":"4","key":"540_CR12","doi-asserted-by":"publisher","first-page":"2517","DOI":"10.1109\/TIT.2011.2111091","volume":"57","author":"S Murphy","year":"2011","unstructured":"Murphy S (2011) The return of the cryptographic boomerang. IEEE Trans Inf Theory 57(4):2517\u20132521. https:\/\/doi.org\/10.1109\/TIT.2011.2111091","journal-title":"IEEE Trans Inf Theory"},{"key":"540_CR13","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-319-69453-5_15","volume-title":"Selected areas in cryptography - SAC 2016","author":"Y Sasaki","year":"2017","unstructured":"Sasaki Y, Todo Y (2017) New differential bounds and division property of lilliput: block cipher with extended generalized feistel network. In: Avanzi R, Heys H (eds) Selected areas in cryptography - SAC 2016. Springer International Publishing, Cham, pp 264\u2013283"},{"key":"540_CR14","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-56617-7_7","volume-title":"Advances in cryptology - EUROCRYPT 2017","author":"Y Sasaki","year":"2017","unstructured":"Sasaki Y, Todo Y (2017) New impossible differential search tool from design and cryptanalysis aspects. In: Coron JS, Nielsen JB (eds) Advances in cryptology - EUROCRYPT 2017. Springer International Publishing, Cham, pp 185\u2013215"},{"key":"540_CR15","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-48519-8_12","volume-title":"Fast software encryption","author":"D Wagner","year":"1999","unstructured":"Wagner D (1999) The boomerang attack. In: Knudsen L (ed) Fast software encryption. Springer, Berlin Heidelberg, Berlin, Heidelberg, pp 156\u2013170"},{"key":"540_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-025-01639-3","author":"Y Zhou","year":"2025","unstructured":"Zhou Y, Wang S, Wu Y et al (2025) Improved method of searching for boomerang distinguishers on feistel structures\u2013applications to warp, twine, lblock, lblock-s, and allpc. Des Codes Crypt. https:\/\/doi.org\/10.1007\/s10623-025-01639-3","journal-title":"Des Codes Crypt"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00540-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-025-00540-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00540-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T05:56:55Z","timestamp":1768197415000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s42400-025-00540-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,12]]},"references-count":16,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["540"],"URL":"https:\/\/doi.org\/10.1186\/s42400-025-00540-9","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,12]]},"assertion":[{"value":"3 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2026","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 Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"100"}}