{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:49:15Z","timestamp":1769316555134,"version":"3.49.0"},"reference-count":46,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T00:00:00Z","timestamp":1643760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072270"],"award-info":[{"award-number":["62072270"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shandong Province Key Research and Development Project","award":["2020ZLYS09"],"award-info":[{"award-number":["2020ZLYS09"]}]},{"name":"Shandong Province Key Research and Development Project","award":["2019JZZY010133"],"award-info":[{"award-number":["2019JZZY010133"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,4,15]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>At CRYPTO 2021, Dong et al. proposed an automatic method of Meet-in-the-Middle (MITM) key-recovery attacks. In this paper, we further extend it to a new automatic model which can be used to find low-data complexity attacks. With the help of the automatic model, we propose MITM attacks against reduced-round versions of all the six members of the SKINNY family with extremely low-data complexity. More precisely, we present MITM attacks against 19-round SKINNY-$n$-$3n$, 15-round SKINNY-$n$-$2n$, 11-round SKINNY-$n$-$n$ with three, two, one plaintext-ciphertext pairs, separately. In addition, we can attack two more rounds and three more rounds with no more than $2^8$ and $2^{32}$ data complexity, respectively.<\/jats:p>","DOI":"10.1093\/comjnl\/bxab208","type":"journal-article","created":{"date-parts":[[2021,12,24]],"date-time":"2021-12-24T12:07:08Z","timestamp":1640347628000},"page":"970-986","source":"Crossref","is-referenced-by-count":1,"title":["Low-Data Cryptanalysis On SKINNY Block Cipher"],"prefix":"10.1093","volume":"66","author":[{"given":"Jialiang","family":"Hua","sequence":"first","affiliation":[{"name":"Institute for Advanced Study , BNRist, Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tai","family":"Liu","sequence":"additional","affiliation":[{"name":"CRRC QINGDAO SIFANG CO. , LTD., Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yulong","family":"Cui","sequence":"additional","affiliation":[{"name":"CRRC QINGDAO SIFANG CO. , LTD., Qingdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingyue","family":"Qin","sequence":"additional","affiliation":[{"name":"Institute for Advanced Study , BNRist, Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyang","family":"Dong","sequence":"additional","affiliation":[{"name":"Institute for Advanced Study , BNRist, Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huiyong","family":"Cui","sequence":"additional","affiliation":[{"name":"Jinan Kinmark Technology Co. , Ltd, Jinan , China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2022,2,2]]},"reference":[{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"7002","DOI":"10.1109\/TIT.2012.2207880","article-title":"Low-Data Complexity Attacks on AES","volume":"58","author":"Bouillaguet","year":"2012","journal-title":"IEEE Trans. Information Theory"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-642-22792-9_10","article-title":"Automatic Search of Attacks on Round-Reduced AES and Applications","volume-title":"Advances in Cryptology - CRYPTO 2011. CRYPTO 2011","author":"Bouillaguet","year":"2011"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/978-3-662-49890-3_9","article-title":"Polytopic Cryptanalysis","volume-title":"Advances in Cryptology - EUROCRYPT 2016. EUROCRYPT 2016","author":"Tiessen","year":"2016"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"192","DOI":"10.46586\/tosc.v2016.i2.192-225","article-title":"Subspace Trail Cryptanalysis and its Applications to AES","volume":"2016","author":"Grassi","year":"2017","journal-title":"IACR Transactions on Symmetric Cryptology"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/978-3-030-65277-7_14","article-title":"Mixture Integral Attacks on Reduced-Round AES with a Known\/Secret S-Box","volume-title":"Progress in Cryptology - INDOCRYPT 2020. INDOCRYPT 2020","author":"Grassi","year":"2020"},{"key":"2023041809375620600_","first-page":"101","article-title":"Low Data Complexity Attack on Reduced Camellia-256","author":"Chen","year":"2012"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/978-981-10-5421-1_11","article-title":"Low-Data Complexity Attacks on Camellia","volume-title":"Applications and Techniques in Information Security. ATIS 2017","author":"Koie","year":"2017"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/978-3-319-49890-4_18","article-title":"Practical Low Data-Complexity Subspace-Trail Cryptanalysis of Round-Reduced PRINCE","volume-title":"Progress in Cryptology - INDOCRYPT 2016. INDOCRYPT 2016","author":"Grassi","year":"2016"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/978-3-662-53008-5_5","article-title":"The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS","volume-title":"Advances in Cryptology - CRYPTO 2016. CRYPTO 2016","author":"Beierle","year":"2016"},{"key":"2023041809375620600_","first-page":"274","article-title":"Tweaks and Keys for Block Ciphers: The TWEAKEY Framework","volume-title":"Advances in Cryptology - ASIACRYPT 2014. ASIACRYPT 2014","author":"Jean","year":"2014"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"88","DOI":"10.46586\/tosc.v2020.iS1.88-131","article-title":"Skinny-aead and skinny-hash","volume":"2020","author":"Beierle","year":"2020","journal-title":"IACR Transactions on Symmetric Cryptology"},{"key":"2023041809375620600_","article-title":"Fork\u00c6v. Submission to NIST Lightweight Cryptography Project","author":"Andreeva","year":"2019"},{"key":"2023041809375620600_","article-title":"Romulus v1. Submission to NIST Lightweight Cryptography Project","author":"Iwata","year":"2019"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/978-3-319-57339-7_7","article-title":"Impossible Differential Cryptanalysis of Reduced-Round SKINNY","volume-title":"Progress in Cryptology - AFRICACRYPT 2017. AFRICACRYPT 2017","author":"Tolba","year":"2017"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"37","DOI":"10.46586\/tosc.v2017.i3.37-72","article-title":"Security analysis of SKINNY under related-tweakey settings","volume":"2017","author":"Liu","year":"2017","journal-title":"IACR Transactions on Symmetric Cryptology"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"124","DOI":"10.46586\/tosc.v2018.i3.124-162","article-title":"Cryptanalysis of reduced round SKINNY block cipher","volume":"2018","author":"Sadeghi","year":"2018","journal-title":"IACR Transactions on Symmetric Cryptology"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1049\/iet-ifs.2016.0488","article-title":"Impossible differential attacks on the SKINNY family of block ciphers","volume":"11","author":"Yang","year":"2017","journal-title":"IET Information Security"},{"key":"2023041809375620600_","first-page":"208","author":"Ankele","year":"2017"},{"key":"2023041809375620600_","first-page":"1","author":"Dunkelman","year":"2020"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"1103","DOI":"10.1007\/s10623-020-00730-1","article-title":"Generalized related-key rectangle attacks on block ciphers with linear key schedule: applications to SKINNY and GIFT","volume":"88","author":"Zhao","year":"2020","journal-title":"Designs, Codes and Cryptography"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"104","DOI":"10.46586\/tosc.v2020.i4.104-129","article-title":"Catching the Fastest Boomerangs: Application to SKINNY","volume":"2020","author":"Delaune","year":"2020","journal-title":"IACR Transactions on Symmetric Cryptology"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"249","DOI":"10.46586\/tosc.v2021.i2.249-291","article-title":"Automated Search Oriented to Key Recovery on Ciphers with Linear Key Schedule: Applications to Boomerangs in SKINNY and ForkSkinny","volume":"2021","author":"Qin","year":"2021","journal-title":"IACR Transactions on Symmetric Cryptology"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"140","DOI":"10.46586\/tosc.v2021.i2.140-198","article-title":"Improved Rectangle Attacks on SKINNY and CRAFT","volume":"2021","author":"Hadipour","year":"2021","journal-title":"IACR Transactions on Symmetric Cryptology"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-030-03329-3_1","article-title":"Programming the Demirci-Sel\u00e7uk Meet-in-the-Middle Attack with Constraints","volume-title":"Advances in Cryptology - ASIACRYPT 2018. ASIACRYPT 2018","author":"Shi","year":"2018"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/978-3-030-84252-9_10","article-title":"Meet-in-the-Middle Attacks Revisited: Key-Recovery, Collision, and Preimage Attacks","volume-title":"Advances in Cryptology - CRYPTO 2021. CRYPTO 2021","author":"Dong","year":"2021"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/978-3-662-47989-6_8","article-title":"Observations on the SIMON Block Cipher Family. Advances in Cryptology \u2013 CRYPTO 2015","volume-title":"CRYPTO 2015","author":"K\u00f6lbl","year":"2015"},{"key":"2023041809375620600_","first-page":"57","article-title":"Differential and Linear Cryptanalysis Using Mixed-Integer Linear Programming","volume-title":"Information Security and Cryptology. Inscrypt 2011","author":"Mouha","year":"2012"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"281","DOI":"10.46586\/tosc.v2017.i1.281-306","article-title":"Analysis of AES, SKINNY, and Others with Constraint Programming","volume":"2017","author":"Sun","year":"2017","journal-title":"IACR Transactions on Symmetric Cryptology"},{"key":"2023041809375620600_","first-page":"158","article-title":"Automatic Security Evaluation and (Related-key) Differential Characteristic Search: Application to SIMON, PRESENT, LBlock, DES(L) and Other Bit-Oriented Block Ciphers","volume-title":"Advances in Cryptology - ASIACRYPT 2014. ASIACRYPT 2014","author":"Sun","year":"2014"},{"key":"2023041809375620600_","first-page":"227","article-title":"Integer Linear Programming for Three-Subset Meet-in-the-Middle Attacks: Application to GIFT","volume-title":"Advances in Information and Computer Security. IWSEC 2018","author":"Sasaki","year":"2018"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1007\/978-3-030-77870-5_27","article-title":"Automatic Search of Meet-in-the-Middle Preimage Attacks on AES-like Hashing","volume-title":"Advances in Cryptology - EUROCRYPT 2021. EUROCRYPT 2021","author":"Bao","year":"2021"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-662-53008-5_6","article-title":"Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks","volume-title":"Advances in Cryptology - CRYPTO 2016. CRYPTO 2016","author":"Derbez","year":"2016"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1109\/C-M.1977.217750","article-title":"Special feature exhaustive cryptanalysis of the NBS data encryption standard","volume":"10","author":"Diffie","year":"1977","journal-title":"Computer"},{"key":"2023041809375620600_","first-page":"229","article-title":"A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN","volume-title":"Selected Areas in Cryptography. SAC 2010","author":"Bogdanov","year":"2011"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/978-3-642-31410-0_9","article-title":"Three-Subset Meet-in-the-Middle Attack on Reduced XTEA","volume-title":"Progress in Cryptology - AFRICACRYPT 2012. AFRICACRYPT 2012","author":"Sasaki","year":"2012"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1007\/978-3-642-42033-7_24","article-title":"Generic Key Recovery Attack on Feistel Scheme","volume-title":"Advances in Cryptology - ASIACRYPT 2013. ASIACRYPT 2013","author":"Isobe","year":"2013"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/978-3-540-89255-7_16","article-title":"Preimage Attacks on 3, 4, and 5-Pass HAVAL","volume-title":"Advances in Cryptology - ASIACRYPT 2008. ASIACRYPT 2008","author":"Sasaki","year":"2008"},{"key":"2023041809375620600_","first-page":"103","article-title":"Preimage Attacks on One-Block MD4, 63-Step MD5 and More. Selected Areas in Cryptography","volume-title":"SAC 2008","author":"Aoki","year":"2009"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/978-3-642-01001-9_8","article-title":"Finding Preimages in Full MD5 Faster Than Exhaustive Search","volume-title":"Advances in Cryptology - EUROCRYPT 2009. EUROCRYPT 2009","author":"Sasaki","year":"2009"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/978-3-642-03356-8_5","article-title":"Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1","volume-title":"Advances in Cryptology - CRYPTO 2009. CRYPTO 2009","author":"Aoki","year":"2009"},{"key":"2023041809375620600_","first-page":"378","article-title":"Meet-in-the-Middle Preimage Attacks on AES Hashing Modes and an Application to Whirlpool","volume-title":"Fast Software Encryption. FSE 2011","author":"Sasaki","year":"2011"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-642-17373-8_4","article-title":"Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2. Advances in Cryptology - ASIACRYPT 2010","volume-title":"ASIACRYPT 2010","author":"Guo","year":"2010"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/978-3-642-14423-3_22","article-title":"Improved Preimage Attack for 68-Step HAS-160","volume-title":"Information, Security and Cryptology - ICISC 2009. ICISC 2009","author":"Hong","year":"2010"},{"key":"2023041809375620600_","first-page":"116","article-title":"Finding Preimages of Tiger Up to 23 Steps","volume-title":"Fast Software Encryption. FSE 2010","author":"Wang","year":"2010"},{"key":"2023041809375620600_","first-page":"433","article-title":"Improved Meet-in-the-Middle Cryptanalysis of KTANTAN (Poster). Information Security and Privacy","volume-title":"ACISP 2011","author":"Wei","year":"2011"},{"key":"2023041809375620600_","doi-asserted-by":"crossref","first-page":"1","DOI":"10.46586\/tosc.v2016.i2.1-29","article-title":"Haraka v2 - Efficient Short-Input Hashing for Post-Quantum Applications","volume":"2016","author":"K\u00f6lbl","year":"2017","journal-title":"IACR Transactions on Symmetric Cryptology"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/4\/970\/49931847\/bxab208.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/4\/970\/49931847\/bxab208.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T21:08:48Z","timestamp":1699996128000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/66\/4\/970\/6519795"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,2]]},"references-count":46,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2022,2,2]]},"published-print":{"date-parts":[[2023,4,15]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxab208","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2023,4]]},"published":{"date-parts":[[2022,2,2]]}}}