{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T05:56:03Z","timestamp":1770702963026,"version":"3.49.0"},"reference-count":0,"publisher":"Universitatsbibliothek der Ruhr-Universitat Bochum","license":[{"start":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T00:00:00Z","timestamp":1670371200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ToSC"],"abstract":"<jats:p>The double boomerang connectivity table (DBCT) is a new table proposed recently to capture the behavior of two consecutive S-boxes in boomerang attacks. In this paper, we observe an interesting property of DBCT of S-box that the ladder switch and the S-box switch happen in most cases for two continuous S-boxes, and for some S-boxes only S-box switch and ladder switch are possible. This property implies an additional criterion for S-boxes to resist the boomerang attacks and provides as well a new evaluation direction for an S-box. Using an extension of the DBCT, we verify that some boomerang distinguishers of TweAES and Deoxys are flawed. On the other hand, inspired by the property, we put forward a formula for estimating boomerang cluster probabilities. Furthermore, we introduce the first model to search for boomerang distinguishers with good cluster probabilities. Applying the model to CRAFT, we obtain 9-round and 10-round boomerang distinguishers with a higher probability than that of previous works.<\/jats:p>","DOI":"10.46586\/tosc.v2022.i4.208-242","type":"journal-article","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T13:34:55Z","timestamp":1670506495000},"page":"208-242","source":"Crossref","is-referenced-by-count":8,"title":["New Properties of the Double Boomerang Connectivity Table"],"prefix":"10.46586","author":[{"given":"Qianqian","family":"Yang","sequence":"first","affiliation":[]},{"given":"Ling","family":"Song","sequence":"additional","affiliation":[]},{"given":"Siwei","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Danping","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Hu","sequence":"additional","affiliation":[]}],"member":"25480","published-online":{"date-parts":[[2022,12,7]]},"container-title":["IACR Transactions on Symmetric Cryptology"],"original-title":[],"link":[{"URL":"https:\/\/philosophymindscience.org\/index.php\/ToSC\/article\/download\/9977\/11490","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/philosophymindscience.org\/index.php\/ToSC\/article\/download\/9977\/11491","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/philosophymindscience.org\/index.php\/ToSC\/article\/download\/9977\/9475","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T14:06:58Z","timestamp":1733839618000},"score":1,"resource":{"primary":{"URL":"https:\/\/philosophymindscience.org\/index.php\/ToSC\/article\/view\/9977"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46586\/tosc.v2022.i4.208-242","relation":{},"ISSN":["2519-173X"],"issn-type":[{"value":"2519-173X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,7]]}}}