{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T09:25:09Z","timestamp":1743585909469,"version":"3.37.3"},"reference-count":11,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T00:00:00Z","timestamp":1602720000000},"content-version":"unspecified","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":["61902100","61902098","2020C01078","2019C01012","6142103190105","Q20F020063"],"award-info":[{"award-number":["61902100","61902098","2020C01078","2019C01012","6142103190105","Q20F020063"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Research, Development Program of Zhejiang Province","award":["61902100","61902098","2020C01078","2019C01012","6142103190105","Q20F020063"],"award-info":[{"award-number":["61902100","61902098","2020C01078","2019C01012","6142103190105","Q20F020063"]}]},{"name":"Foundation of Science and Technology on Communication Security Laboratory","award":["61902100","61902098","2020C01078","2019C01012","6142103190105","Q20F020063"],"award-info":[{"award-number":["61902100","61902098","2020C01078","2019C01012","6142103190105","Q20F020063"]}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["61902100","61902098","2020C01078","2019C01012","6142103190105","Q20F020063"],"award-info":[{"award-number":["61902100","61902098","2020C01078","2019C01012","6142103190105","Q20F020063"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2020,10,15]]},"abstract":"<jats:p>GOST, known as GOST-28147-89, was standardized as the Russian encryption standard in 1989. It is a lightweight-friendly cipher and suitable for the resource-constrained environments. However, due to the simplicity of GOST\u2019s key schedule, it encountered reflection attack and fixed point attack. In order to resist such attacks, the designers of GOST proposed a modification of GOST, namely, 2-GOST. This new version changes the order of subkeys in the key schedule and uses concrete S-boxes in round function. But regarding single-key attacks on full-round 2-GOST, Ashur et al. proposed a reflection attack with data of <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:mn>32<\/a:mn>\n                           <\/a:mrow>\n                        <\/a:msup>\n                     <\/a:math>\n                  <\/jats:inline-formula> on a weak-key class of size <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:mn>224<\/c:mn>\n                           <\/c:mrow>\n                        <\/c:msup>\n                     <\/c:math>\n                  <\/jats:inline-formula>, as well as the fixed point attack and impossible reflection attack with data of <jats:inline-formula>\n                     <e:math xmlns:e=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M3\">\n                        <e:msup>\n                           <e:mrow>\n                              <e:mn>2<\/e:mn>\n                           <\/e:mrow>\n                           <e:mrow>\n                              <e:mn>64<\/e:mn>\n                           <\/e:mrow>\n                        <\/e:msup>\n                     <\/e:math>\n                  <\/jats:inline-formula> for all possible keys. Note that the attacks applicable for all possible keys need the entire plaintext space. In other words, these are codebook attacks. In this paper, we propose single-key attacks on 2-GOST with only about <jats:inline-formula>\n                     <g:math xmlns:g=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M4\">\n                        <g:msup>\n                           <g:mrow>\n                              <g:mn>2<\/g:mn>\n                           <\/g:mrow>\n                           <g:mrow>\n                              <g:mn>32<\/g:mn>\n                           <\/g:mrow>\n                        <\/g:msup>\n                     <\/g:math>\n                  <\/jats:inline-formula> data instead of codebook. Firstly, we apply 2-dimensional meet-in-the-middle attack combined with splice-cut technique on full-round 2-GOST. This attack is applicable for all possible keys, and its data complexity reduces from previous <jats:inline-formula>\n                     <i:math xmlns:i=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M5\">\n                        <i:msup>\n                           <i:mrow>\n                              <i:mn>2<\/i:mn>\n                           <\/i:mrow>\n                           <i:mrow>\n                              <i:mn>64<\/i:mn>\n                           <\/i:mrow>\n                        <\/i:msup>\n                     <\/i:math>\n                  <\/jats:inline-formula> to <jats:inline-formula>\n                     <k:math xmlns:k=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M6\">\n                        <k:msup>\n                           <k:mrow>\n                              <k:mn>2<\/k:mn>\n                           <\/k:mrow>\n                           <k:mrow>\n                              <k:mn>32<\/k:mn>\n                           <\/k:mrow>\n                        <\/k:msup>\n                     <\/k:math>\n                  <\/jats:inline-formula>. Besides that, we apply splice-cut meet-in-the-middle attack on 31-round 2-GOST with only data of <jats:inline-formula>\n                     <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M7\">\n                        <m:msup>\n                           <m:mrow>\n                              <m:mn>2<\/m:mn>\n                           <\/m:mrow>\n                           <m:mrow>\n                              <m:mn>32<\/m:mn>\n                           <\/m:mrow>\n                        <\/m:msup>\n                     <\/m:math>\n                  <\/jats:inline-formula>. In this attack, we only need 8 bytes of memory, which is negligible.<\/jats:p>","DOI":"10.1155\/2020\/8886032","type":"journal-article","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T20:05:10Z","timestamp":1602792310000},"page":"1-10","source":"Crossref","is-referenced-by-count":1,"title":["Improved Single-Key Attacks on 2-GOST"],"prefix":"10.1155","volume":"2020","author":[{"given":"Qiuhua","family":"Zheng","sequence":"first","affiliation":[{"name":"Hangzhou Dianzi University, Hangzhou 310018, China"}]},{"given":"Yinhao","family":"Hu","sequence":"additional","affiliation":[{"name":"Hangzhou Dianzi University, Hangzhou 310018, China"}]},{"given":"Tao","family":"Pei","sequence":"additional","affiliation":[{"name":"Wuhan Maritime Communication Research Institute, Wuhan 430079, China"}]},{"given":"Shengwang","family":"Xu","sequence":"additional","affiliation":[{"name":"Hangzhou Dianzi University, Hangzhou 310018, China"}]},{"given":"Junzhe","family":"Yu","sequence":"additional","affiliation":[{"name":"Hangzhou Dianzi University, Hangzhou 310018, China"}]},{"given":"Ting","family":"Wu","sequence":"additional","affiliation":[{"name":"Hangzhou Dianzi University, Hangzhou 310018, China"}]},{"given":"Yanzhao","family":"Shen","sequence":"additional","affiliation":[{"name":"Hangzhou Dianzi University, Hangzhou 310018, China"},{"name":"Science and Technology on Communication Security Laboratory, Chengdu 610041, China"}]},{"given":"Yingpei","family":"Zeng","sequence":"additional","affiliation":[{"name":"Hangzhou Dianzi University, Hangzhou 310018, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5868-4730","authenticated-orcid":true,"given":"Tingting","family":"Cui","sequence":"additional","affiliation":[{"name":"Hangzhou Dianzi University, Hangzhou 310018, China"}]}],"member":"311","reference":[{"journal-title":"Federal Information Processing Standard-Cryptographic Protection\u2014Cryptographic Algorithm","year":"1989","author":"Russian National Bureau of Standards","key":"1"},{"key":"2"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21702-9_17"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34047-5_2"},{"key":"5","first-page":"65","article-title":"A lightweight-friendly modification of GOST block cipher","volume":"2015","author":"A. A. Dmukh","year":"2015","journal-title":"IACR Cryptology ePrint Archive"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.13154\/tosc.v2017.i1.203-214"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-014-0102-9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40392-7_5"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04159-4_7"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/c-m.1977.217750"},{"key":"11","first-page":"425","article-title":"Note of multidimensional MITM attack on 25-round TWINE-128","volume":"2014","author":"L. Wen","year":"2014","journal-title":"IACR Cryptology ePrint Archive"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8886032.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8886032.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8886032.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T20:05:15Z","timestamp":1602792315000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2020\/8886032\/"}},"subtitle":[],"editor":[{"given":"Stelvio","family":"Cimato","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2020,10,15]]},"references-count":11,"alternative-id":["8886032","8886032"],"URL":"https:\/\/doi.org\/10.1155\/2020\/8886032","relation":{},"ISSN":["1939-0122","1939-0114"],"issn-type":[{"type":"electronic","value":"1939-0122"},{"type":"print","value":"1939-0114"}],"subject":[],"published":{"date-parts":[[2020,10,15]]}}}