{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T10:31:09Z","timestamp":1721903469952},"reference-count":22,"publisher":"Institution of Engineering and Technology (IET)","issue":"4","license":[{"start":{"date-parts":[[2023,5,28]],"date-time":"2023-05-28T00:00:00Z","timestamp":1685232000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["ietresearch.onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["IET Information Security"],"published-print":{"date-parts":[[2023,7]]},"abstract":"Abstract<\/jats:title>In the field of symmetric key cryptography, the security against distinguishing attacks is one of the crucial security requirements. With advancements in computing capabilities and cryptanalysis techniques in recent years, more efficient methods have been proposed for exploring distinguishers using Mixed\u2010Integer Linear Programing (MILP) or satisfiability problem (SAT), thereby updating the security bounds of various ciphers. Piccolo is a lightweight block cipher proposed at CHES in 2011, with support 80\u2010bit and 128\u2010bit keys. Designers have undergone a rough security evaluation against differential, impossible differential, and related\u2010key differential attacks, based on nibble\u2010wise estimations due to the limitation of computational resource. Here, the authors perform bit\u2010level evaluations on Piccolo block cipher against differential, integral and impossible differential attacks by leveraging SAT\u2010based approaches. For the first time, the authors succeed in identifying optimal differential distinguisher on 6 rounds in the single key setting, and on 10\/12 rounds in the related\u2010key setting for 80\u2010bit and 128\u2010bit keys, respectively. For integral attacks, the authors find integral distinguisher up to 7 rounds. Although the number of attacked rounds is the same as that of the previous attack, the authors find the 56th ordered integral distinguisher, which enable reducing the data complexity for attacks from 263<\/jats:sup> to 256<\/jats:sup>. As a result, the authors find the 7\u2010round impossible differentials which is the same number of rounds as the previous nibble\u2010wise evaluation.<\/jats:p>","DOI":"10.1049\/ise2.12119","type":"journal-article","created":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T04:49:02Z","timestamp":1685335742000},"page":"616-625","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Bit\u2010level evaluation of piccolo block cipher by satisfiability problem solver"],"prefix":"10.1049","volume":"17","author":[{"ORCID":"http:\/\/orcid.org\/0009-0004-8136-0135","authenticated-orcid":false,"given":"Shion","family":"Utsumi","sequence":"first","affiliation":[{"name":"University of Hyogo Kobe Japan"}]},{"given":"Kosei","family":"Sakamoto","sequence":"additional","affiliation":[{"name":"University of Hyogo Kobe Japan"}]},{"given":"Takanori","family":"Isobe","sequence":"additional","affiliation":[{"name":"University of Hyogo Kobe Japan"},{"name":"National Institute of Information and Communications Technology Koganei Japan"}]}],"member":"265","published-online":{"date-parts":[[2023,5,28]]},"reference":[{"key":"e_1_2_10_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23951-9_23"},{"key":"e_1_2_10_3_1","first-page":"283","volume-title":"INDOCRYPT, volume 7668\u00a0of Lecture Notes in Computer Science","author":"Wu S.","year":"2012"},{"key":"e_1_2_10_4_1","first-page":"48","volume-title":"AsiaJCIS","author":"Sato H.","year":"2019"},{"key":"e_1_2_10_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-016-9157-y"},{"key":"e_1_2_10_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31448-3_6"},{"key":"e_1_2_10_7_1","first-page":"308","volume-title":"INDOCRYPT, volume 8250 of Lecture Notes in Computer Science","author":"Minier M.","year":"2013"},{"key":"e_1_2_10_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00630563"},{"key":"e_1_2_10_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_2"},{"key":"e_1_2_10_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0129-3"},{"key":"e_1_2_10_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0052343"},{"key":"e_1_2_10_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45661-9_9"},{"key":"e_1_2_10_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_12"},{"key":"e_1_2_10_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53887-6_24"},{"key":"e_1_2_10_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/bf00203965"},{"key":"e_1_2_10_16_1","doi-asserted-by":"publisher","DOI":"10.46586\/tosc.v2021.i1.269-315"},{"key":"e_1_2_10_17_1","doi-asserted-by":"publisher","DOI":"10.46586\/tosc.v2018.i3.93-123"},{"key":"e_1_2_10_18_1","first-page":"128","volume-title":"ASIACRYPT (1), volume 10624 of Lecture Notes in Computer Science","author":"Sun L.","year":"2017"},{"key":"e_1_2_10_19_1","article-title":"The simplest SAT model of combining matsui\u2019s bounding conditions with sequential encoding method","author":"Wang S.","year":"2022","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_2_10_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11564751_73"},{"key":"e_1_2_10_21_1","first-page":"535","volume-title":"SAC, volume 12804 of Lecture Notes in Computer Science","author":"Banik S.","year":"2020"},{"key":"e_1_2_10_22_1","doi-asserted-by":"publisher","DOI":"10.46586\/tosc.v2021.i1.37-77"},{"key":"e_1_2_10_23_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2023.i2.115-154"}],"container-title":["IET Information Security"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T11:51:14Z","timestamp":1692273074000},"score":1,"resource":{"primary":{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/10.1049\/ise2.12119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,28]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["10.1049\/ise2.12119"],"URL":"https:\/\/doi.org\/10.1049\/ise2.12119","archive":["Portico"],"relation":{},"ISSN":["1751-8709","1751-8717"],"issn-type":[{"value":"1751-8709","type":"print"},{"value":"1751-8717","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,28]]},"assertion":[{"value":"2023-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-05-16","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-05-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}