{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T16:00:12Z","timestamp":1649174412803},"reference-count":12,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2022]]},"abstract":"<p style='text-indent:20px;'>We consider the Improved Generalized Feistel Structure (IGFS) suggested by Suzaki and Minematsu (LNCS, 2010). It is a generalization of the classical Feistel cipher. The message is divided into <inline-formula><tex-math id=\"M1\">\\begin{document}$ k $\\end{document}<\/tex-math><\/inline-formula> subblocks, a Feistel transformation is applied to each pair of successive subblocks, and then a permutation of the subblocks follows. This permutation affects the diffusion property of the cipher. IGFS with relatively big <inline-formula><tex-math id=\"M2\">\\begin{document}$ k $\\end{document}<\/tex-math><\/inline-formula> and good diffusion are of particular interest for light weight applications.<\/p><p style='text-indent:20px;'>Suzaki and Minematsu (LNCS, 2010) study the case when one and the same permutation is applied at each round, while we consider IGFS with possibly different permutations at the different rounds. In this case we present permutation sequences yielding IGFS with the best known by now diffusion for all even <inline-formula><tex-math id=\"M3\">\\begin{document}$ k\\le 2048 $\\end{document}<\/tex-math><\/inline-formula>. For <inline-formula><tex-math id=\"M4\">\\begin{document}$ k\\le 16 $\\end{document}<\/tex-math><\/inline-formula> they are found by a computer-aided search, while for <inline-formula><tex-math id=\"M5\">\\begin{document}$ 18\\le k\\le 2048 $\\end{document}<\/tex-math><\/inline-formula> we first consider several recursive constructions of a permutation sequence for <inline-formula><tex-math id=\"M6\">\\begin{document}$ k $\\end{document}<\/tex-math><\/inline-formula> subblocks from two permutation sequences for <inline-formula><tex-math id=\"M7\">\\begin{document}$ k_a&lt; k $\\end{document}<\/tex-math><\/inline-formula> and <inline-formula><tex-math id=\"M8\">\\begin{document}$ k_b&lt; k $\\end{document}<\/tex-math><\/inline-formula> subblocks respectively. Using computer, we apply these constructions to obtain permutation sequences with good diffusion for each even <inline-formula><tex-math id=\"M9\">\\begin{document}$ k\\le 2048 $\\end{document}<\/tex-math><\/inline-formula>. Finally we obtain infinite families of permutation sequences for <inline-formula><tex-math id=\"M10\">\\begin{document}$ k&gt;2048 $\\end{document}<\/tex-math><\/inline-formula>.<\/p><\/jats:p>","DOI":"10.3934\/amc.2020102","type":"journal-article","created":{"date-parts":[[2020,10,12]],"date-time":"2020-10-12T09:16:15Z","timestamp":1602494175000},"page":"95","source":"Crossref","is-referenced-by-count":0,"title":["On the diffusion of the Improved Generalized Feistel"],"prefix":"10.3934","volume":"16","author":[{"given":"Tsonka","family":"Baicheva","sequence":"first","affiliation":[]},{"given":"Svetlana","family":"Topalova","sequence":"additional","affiliation":[]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2020102-1","doi-asserted-by":"publisher","unstructured":"T. Baicheva and S. Topalova, On the diffusion property of the Improved Generalized Feistel with different permutations for each round, in Algebraic Informatics, CAI 2019<\/i> (eds. M. \u0106iri\u0107, M. Droste and J.\u00c9. Pin), Lecture Notes in Computer Science, 11545<\/b> (2019), 38\u201349.","DOI":"10.1007\/978-3-030-21363-3_4"},{"key":"key-10.3934\/amc.2020102-2","doi-asserted-by":"publisher","unstructured":"T. Berger, M. Minier and G. Thomas, Extended generalized Feistel networks using matrix representation, Selected Areas in Cryptography\u2013SAC 2013, <\/i> Lecture Notes in Comput. Sci.<\/i>, Springer, Heidelberg, 8282<\/b> (2014), 289\u2013305.","DOI":"10.1007\/978-3-662-43414-7_15"},{"key":"key-10.3934\/amc.2020102-3","doi-asserted-by":"publisher","unstructured":"T. Berger, J. Francq, M. Minier, G. Thomas.Extended generalized Feistel networks using matrix representation to propose a new lightweight block cipher: Lilliput, IEEE Transactions on Computers<\/i>, 65<\/b> (2016), 2074-2089.","DOI":"10.1109\/TC.2015.2468218"},{"key":"key-10.3934\/amc.2020102-4","doi-asserted-by":"publisher","unstructured":"D. Hong, J. Sung, S. Hong, J. Lim, S. Lee, B. Koo, C. Lee, D. Chang, J. Lee, K. Jeong, H. Kim, J. Kim, S. Chee.HIGHT: A new block cipher suitable for low-resource device, Lecture Notes in Computer Science - CHES<\/i>, 4249<\/b> (2006), 46-59.","DOI":"10.1007\/11894063_4"},{"key":"key-10.3934\/amc.2020102-5","doi-asserted-by":"publisher","unstructured":"K. Nyberg, Generalized Feistel networks, in Advances in Cryptology - ASIACRYPT '96<\/i> (eds. K. Kim and T. Matsumoto), Lecture Notes in Computer Science, 1163<\/b> (1996), 90\u2013104.","DOI":"10.1007\/BFb0034838"},{"key":"key-10.3934\/amc.2020102-6","unstructured":"R. L. Rivest, M. J. B. Robshaw, R. Sidney and Y. L. Yin, The RC6 block cipher, August 1998. Available from: http:\/\/people.csail.mit.edu\/rivest\/pubs\/RRSY98.pdf<\/a>."},{"key":"key-10.3934\/amc.2020102-7","doi-asserted-by":"publisher","unstructured":"C. E. Shannon.Communication theory of secrecy systems, Bell System Technical Journal<\/i>, 28<\/b> (1949), 656-715.","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"key-10.3934\/amc.2020102-8","doi-asserted-by":"crossref","unstructured":"T. Shirai, K. Shibutani, T. Akishita, S. Moriai, T. Iwata.The 128-bit block cipher CLEFIA (Extended abstract), Lecture Notes in Computer Science\u2013FSE<\/i>, 4593<\/b> (2007), 181-195.","DOI":"10.1007\/978-3-540-74619-5_12"},{"key":"key-10.3934\/amc.2020102-9","doi-asserted-by":"publisher","unstructured":"T. Suzaki, K. Minematsu.Improving the generalized Feistel, Lecture Notes in Computer Science\u2013FSE<\/i>, 6147<\/b> (2010), 19-39.","DOI":"10.1007\/978-3-642-13858-4_2"},{"key":"key-10.3934\/amc.2020102-10","doi-asserted-by":"publisher","unstructured":"L. Zhang, W. Wu.Analysis of permutation choices for enhanced generalised Feistel structure with SP-type round function, IET Information Security<\/i>, 11<\/b> (2017), 121-128.","DOI":"10.1049\/iet-ifs.2015.0433"},{"key":"key-10.3934\/amc.2020102-11","doi-asserted-by":"publisher","unstructured":"Y. Zheng, T. Matsumoto and H. Imai, On the construction of block ciphers provably secure and not relying on any unproved hypothesis, Advances in Cryptology - CRYPTO'89<\/i>, Lecture Notes in Computer Science, 435<\/b> (1990), 461\u2013480.","DOI":"10.1007\/0-387-34805-0_42"},{"key":"key-10.3934\/amc.2020102-12","doi-asserted-by":"publisher","unstructured":"Y. Wang, W. Wu.New criterion for diffusion property and applications to improved GFS and EGFN, Designs Codes and Cryptography<\/i>, 81<\/b> (2016), 393-412.","DOI":"10.1007\/s10623-015-0161-8"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/www.aimsciences.org\/article\/exportPdf?id=8e2cdb4c-880e-4ec8-9094-034b02dcc361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T11:44:02Z","timestamp":1640864642000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/article\/doi\/10.3934\/amc.2020102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022]]}},"alternative-id":["1930-5346_2022_1_95"],"URL":"https:\/\/doi.org\/10.3934\/amc.2020102","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}