{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T23:13:11Z","timestamp":1768950791722,"version":"3.49.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T00:00:00Z","timestamp":1768867200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T00:00:00Z","timestamp":1768867200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["3282024048"],"award-info":[{"award-number":["3282024048"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["3282024019"],"award-info":[{"award-number":["3282024019"]}],"id":[{"id":"10.13039\/501100012226","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>\n                  <jats:p>\n                    In lightweight block cipher designs, involutory components are often employed to minimize circuit area. However, these components can also introduce security vulnerabilities. Loong is a family of lightweight block ciphers based on the Substitution-Permutation Network (SPN) structure. Each round of Loong incorporates two involutory MDS matrices and two involutory S-boxes, resulting in a fully involutory round function. While these operations provide high diffusion and a substantial algebraic degree, the involutory nature of the design makes Loong vulnerable to weak-key attacks. In this paper, we present several notable observations regarding the round function of Loong. By exploiting the unique properties of its involutory round function, we identify weak-key differential characteristics for all three full-round variants of Loong. Specifically, the probabilities of weak-key differential characteristics for Loong-64, Loong-80, and Loong-128 are\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$2^{-26.83}$$<\/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>26.83<\/mml:mn>\n                            <\/mml:mrow>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    ,\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$2^{-37.42}$$<\/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>37.42<\/mml:mn>\n                            <\/mml:mrow>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    and\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$2^{-46.66}$$<\/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>46.66<\/mml:mn>\n                            <\/mml:mrow>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , respectively. The corresponding weak-key spaces are of sizes\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$2^{36}$$<\/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:mn>36<\/mml:mn>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    ,\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$2^{52}$$<\/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:mn>52<\/mml:mn>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    and\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$2^{96}$$<\/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:mn>96<\/mml:mn>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . These findings effectively compromise the security of Loong. Furthermore, we conducted experiments on a personal computer and identified practical differential characteristics for Loong-64. Additionally, we analyze the security of block ciphers with involutory round functions in general. Our findings indicate that such designs are more prone to weak-key attacks and are even more vulnerable to general differential cryptanalysis. While the use of involutory round functions reduces circuit area and improves cipher efficiency, it also introduces significant security weaknesses.\n                  <\/jats:p>","DOI":"10.1186\/s42400-025-00471-5","type":"journal-article","created":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T09:56:08Z","timestamp":1768902968000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Practical weak-key attack against full-round Loong: an involutional lightweight block cipher"],"prefix":"10.1186","volume":"9","author":[{"given":"Hao","family":"Guo","sequence":"first","affiliation":[]},{"given":"Caibing","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Qianqian","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,20]]},"reference":[{"key":"471_CR1","doi-asserted-by":"crossref","unstructured":"Banik S, Bogdanov A, Isobe T, Shibutani K, Regazzoni F (2015) Midori: A block cipher for low energy. In: International Conference on the Theory and Application of Cryptology and Information Security","DOI":"10.1007\/978-3-662-48800-3_17"},{"key":"471_CR2","doi-asserted-by":"crossref","unstructured":"Banik S, Pandey SK, Peyrin T, Sasaki Y, Sim SM, Todo Y (2017) GIFT: A small present - towards reaching the limit of lightweight encryption. In: Fischer, W., Homma, N. (eds.) Cryptographic Hardware and Embedded Systems - CHES 2017 - 19th International Conference, Taipei, Taiwan, September 25-28, Proceedings. Lecture Notes in Computer Science, pp 321\u2013345","DOI":"10.1007\/978-3-319-66787-4_16"},{"issue":"1","key":"471_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.46586\/tosc.v2019.i1.5-45","volume":"2019","author":"C Beierle","year":"2019","unstructured":"Beierle C, Leander G, Moradi A, Rasoolzadeh S (2019) Craft: lightweight tweakable block cipher with efficient protection against dfa attacks. IACR Trans Symmetric Cryptol 2019(1):5\u201345","journal-title":"IACR Trans Symmetric Cryptol"},{"key":"471_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-38424-3_1","volume-title":"Advances in Cryptology-CRYPTO\u2019 90","author":"E Biham","year":"1991","unstructured":"Biham E, Shamir A (1991) Differential cryptanalysis of des-like cryptosystems. In: Menezes AJ, Vanstone SA (eds) Advances in Cryptology-CRYPTO\u2019 90. Springer, Berlin, Heidelberg, pp 2\u201321"},{"key":"471_CR5","doi-asserted-by":"crossref","unstructured":"Bogdanov A, Knudsen LR, Leander G, Paar C, Poschmann A, Robshaw MJB, Seurin Y, Vikkelsoe C (2007) PRESENT: an ultra-lightweight block cipher. In: Paillier, P., Verbauwhede, I. (eds.) Cryptographic Hardware and Embedded Systems - CHES 2007, 9th International Workshop, Vienna, Austria, September 10-13, Proceedings. Lecture Notes in Computer Science pp 450\u2013466","DOI":"10.1007\/978-3-540-74735-2_31"},{"key":"471_CR6","unstructured":"Daemen J, Rijmen V (1999) Aes proposal: Rijndael"},{"issue":"3","key":"471_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.13154\/tosc.v2020.i3.119-151","volume":"2020","author":"H Guo","year":"2020","unstructured":"Guo H, Sun S, Shi D, Sun L, Sun Y, Hu L, Wang M (2020) Differential attacks on craft exploiting the involutory s-boxes and tweak additions. IACR Trans Symmetric Cryptol 2020(3):119\u2013151. https:\/\/doi.org\/10.13154\/tosc.v2020.i3.119-151","journal-title":"IACR Trans Symmetric Cryptol"},{"key":"471_CR8","doi-asserted-by":"crossref","unstructured":"Lai X, Massey JL, Murphy S (1991) Markov ciphers and differential cryptanalysis. In: Workshop on the Theory and Application of of Cryptographic Techniques, pp 17\u201338. Springer","DOI":"10.1007\/3-540-46416-6_2"},{"key":"471_CR9","unstructured":"Leander G, Rasoolzadeh S (2021) Two Sides of The Same Coin: Weak-Keys and More Efficient Variants of CRAFT. Cryptology ePrint Archive, Report 2021\/238. https:\/\/eprint.iacr.org\/2021\/238"},{"key":"471_CR10","doi-asserted-by":"crossref","unstructured":"Leurent G (2015) Differential forgery attack against lac. In: International Conference on Selected Areas in Cryptography","DOI":"10.1007\/978-3-319-31301-6_13"},{"key":"471_CR11","doi-asserted-by":"publisher","first-page":"136023","DOI":"10.1109\/ACCESS.2019.2940330","volume":"7","author":"B Liu","year":"2019","unstructured":"Liu B, Li L, Wu R, Xie M, Li QP (2019) Loong: a family of involutional lightweight block cipher based on SPN structure. IEEE Access 7:136023\u2013136035","journal-title":"IEEE Access"},{"key":"471_CR12","doi-asserted-by":"crossref","unstructured":"Matsui M (1993) Linear cryptanalysis method for DES cipher. In: Helleseth, T. (ed.) Advances in Cryptology - EUROCRYPT \u201993, Workshop on the Theory and Application of of Cryptographic Techniques, Lofthus, Norway, May 23-27, Proceedings. Lecture Notes in Computer Science, pp 386\u2013397. Springer","DOI":"10.1007\/3-540-48285-7_33"},{"key":"471_CR13","unstructured":"Standard DE, et al (1999) Data encryption standard. Federal Inform Process Standards Public"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00471-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-025-00471-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00471-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T09:56:11Z","timestamp":1768902971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s42400-025-00471-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,20]]},"references-count":13,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["471"],"URL":"https:\/\/doi.org\/10.1186\/s42400-025-00471-5","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,20]]},"assertion":[{"value":"28 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 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 would like to thank the anonymous reviewers for their valuable comments.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Acknowledgements"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"107"}}