{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:41:40Z","timestamp":1747190500595,"version":"3.40.5"},"reference-count":26,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,9,23]],"date-time":"2021-09-23T00:00:00Z","timestamp":1632355200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2021,9,23]]},"abstract":"<jats:p>This paper proposes a new approach to generalizing Feistel networks, which unifies the classical (balanced) Feistel network and the Lai\u2013Massey structure. We call the new structure extended Feistel (E-Feistel) network. To justify its soundness, we investigate its indistinguishability using Patarin\u2019s H-coefficient technique. As a result, it is proved that the 4-round key-alternating E-Feistel (KAEF) cipher with adequately derived keys and identical round functions is secure up to <jats:inline-formula>\n                     <a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\">\n                        <a:msup>\n                           <a:mrow>\n                              <a:mn>2<\/a:mn>\n                           <\/a:mrow>\n                           <a:mrow>\n                              <a:mrow>\n                                 <a:mi>n<\/a:mi>\n                                 <a:mo>\/<\/a:mo>\n                                 <a:mn>2<\/a:mn>\n                              <\/a:mrow>\n                           <\/a:mrow>\n                        <\/a:msup>\n                     <\/a:math>\n                  <\/jats:inline-formula> queries, i.e., birthday-bound security. In addition, when adjacent round keys are independent and independent round functions are used, the 6-round KAEF is secure up to beyond-birthday-bound <jats:inline-formula>\n                     <c:math xmlns:c=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\">\n                        <c:msup>\n                           <c:mrow>\n                              <c:mn>2<\/c:mn>\n                           <\/c:mrow>\n                           <c:mrow>\n                              <c:mrow>\n                                 <c:mrow>\n                                    <c:mn>2<\/c:mn>\n                                    <c:mi>n<\/c:mi>\n                                 <\/c:mrow>\n                                 <c:mo>\/<\/c:mo>\n                                 <c:mn>3<\/c:mn>\n                              <\/c:mrow>\n                           <\/c:mrow>\n                        <\/c:msup>\n                     <\/c:math>\n                  <\/jats:inline-formula> queries. Our results indicate that the E-Feistel structure is secure and reliable and can be adopted in designing practical block ciphers.<\/jats:p>","DOI":"10.1155\/2021\/2751797","type":"journal-article","created":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T15:12:30Z","timestamp":1632496350000},"page":"1-26","source":"Crossref","is-referenced-by-count":1,"title":["New Approach towards Generalizing Feistel Networks and Its Provable Security"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2927-1133","authenticated-orcid":true,"given":"Jiajie","family":"Liu","sequence":"first","affiliation":[{"name":"College of Liberal Arts and Sciences, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Sun","sequence":"additional","affiliation":[{"name":"College of Liberal Arts and Sciences, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Li","sequence":"additional","affiliation":[{"name":"College of Liberal Arts and Sciences, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1080\/0161-118491858746"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/s1363-4127(97)81325-8"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/2744769.2747946"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48324-4_16"},{"key":"5","article-title":"SMS4 encryption algorithm for wireless networks","volume":"329","author":"W. Diffie","year":"2008","journal-title":"IACR Cryptol. ePrint Arch."},{"volume-title":"The 128-bit block cipher MARS","year":"2003","author":"G. Bose","key":"6"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/bfb0034838"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/tc.2015.2468218"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-48000-6_2"},{"first-page":"458","article-title":"The mesh block ciphers","author":"J. N. Jr","key":"10"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30564-4_8"},{"key":"12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-60769-5","volume-title":"The Design of Rijndael - the Advanced Encryption Standard(AES)","author":"J. Daemen","year":"2020","edition":"2nd"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_13"},{"key":"14","first-page":"39","article-title":"Camellia: a 128-bit block cipher suitable for multiple platforms- design and analysis","volume-title":"In","author":"K. Aoki"},{"first-page":"447","article-title":"How to construct pseudo-random permutations from pseudo-random functions","author":"M. Luby","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_7"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_33"},{"first-page":"265","article-title":"The related-key analysis of feistel constructions","author":"M. Barbosa","key":"18"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30539-2_3"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03326-2_8"},{"first-page":"256","article-title":"How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function","author":"J. Patarin","key":"21"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_19"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53018-4_1"},{"key":"24","unstructured":"DodisY.KatzJ.SteinbergerJ.ThiruvengadamA.ZhangZ.Provable security of substitution-permutation networks\u201d cryptology eprint archive2017http:\/\/eprint.iacr.org\/2017\/016.pdf Report 2017\/016"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48800-3_6"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47989-6_9"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/2751797.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/2751797.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/2751797.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T15:12:37Z","timestamp":1632496357000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2021\/2751797\/"}},"subtitle":[],"editor":[{"given":"Majid","family":"Khan","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,9,23]]},"references-count":26,"alternative-id":["2751797","2751797"],"URL":"https:\/\/doi.org\/10.1155\/2021\/2751797","relation":{},"ISSN":["1939-0122","1939-0114"],"issn-type":[{"type":"electronic","value":"1939-0122"},{"type":"print","value":"1939-0114"}],"subject":[],"published":{"date-parts":[[2021,9,23]]}}}