{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,8]],"date-time":"2025-06-08T04:00:55Z","timestamp":1749355255721,"version":"3.41.0"},"reference-count":20,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2025,6,1]]},"DOI":"10.1587\/transfun.2023eap1159","type":"journal-article","created":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T22:11:28Z","timestamp":1733436688000},"page":"816-833","source":"Crossref","is-referenced-by-count":0,"title":["Towards Finding Better Differentials on Multiple-Branch-Based Structures with the SAT Method"],"prefix":"10.1587","volume":"E108.A","author":[{"given":"Kazuma","family":"TAKA","sequence":"first","affiliation":[{"name":"University of Hyogo"}]},{"given":"Tatsuya","family":"ISHIKAWA","sequence":"additional","affiliation":[{"name":"WDB KOUGAKU Co., Ltd"}]},{"given":"Kosei","family":"SAKAMOTO","sequence":"additional","affiliation":[{"name":"Mitsubishi Electric Corporation"}]},{"given":"Takanori","family":"ISOBE","sequence":"additional","affiliation":[{"name":"University of Hyogo"}]}],"member":"532","reference":[{"doi-asserted-by":"crossref","unstructured":"[2] J. Borghoff, A. Canteaut, T. G\u00fcneysu, E.B. Kavun, M. Knezevic, L.R. Knudsen, G. Leander, V. Nikov, C. Paar, C. Rechberger, P. Rombouts, S.S. Thomsen, and T. Yal\u00e7in, \u201cPRINCE\u2006\u2014\u2006A low-latency block cipher for pervasive computing applications\u2006\u2014\u2006Extended abstract,\u201d ASIACRYPT, Lecture Notes in Computer Science, vol.7658, pp.208-225, Springer, 2012. 10.1007\/978-3-642-34961-4_14","key":"1","DOI":"10.1007\/978-3-642-34961-4_14"},{"doi-asserted-by":"publisher","unstructured":"[3] R. Avanzi, \u201cThe QARMA block cipher family. Almost MDS matrices over rings with zero divisors, nearly symmetric even-mansour constructions with non-involutory central rounds, and search heuristics for low-latency S-boxes,\u201d IACR Trans. Symmetric Cryptol., vol.2017, no.1, pp.4-44, 2017. 10.46586\/tosc.v2017.i1.4-44","key":"2","DOI":"10.46586\/tosc.v2017.i1.4-44"},{"doi-asserted-by":"crossref","unstructured":"[4] S. Banik, A. Bogdanov, T. Isobe, K. Shibutani, H. Hiwatari, T. Akishita, and F. Regazzoni, \u201cMidori: A block cipher for low energy,\u201d ASIACRYPT (2), Lecture Notes in Computer Science, vol.9453, pp.411-436, Springer, 2015. 10.1007\/978-3-662-48800-3_17","key":"3","DOI":"10.1007\/978-3-662-48800-3_17"},{"doi-asserted-by":"crossref","unstructured":"[5] C. Beierle, J. Jean, S. K\u00f6lbl, G. Leander, A. Moradi, T. Peyrin, Y. Sasaki, P. Sasdrich, and S.M. Sim, \u201cThe SKINNY family of block ciphers and its low-latency variant MANTIS,\u201d CRYPTO (2), Lecture Notes in Computer Science, vol.9815, pp.123-153, Springer, 2016. 10.1007\/978-3-662-53008-5_5","key":"4","DOI":"10.1007\/978-3-662-53008-5_5"},{"doi-asserted-by":"publisher","unstructured":"[7] G. Leander, T. Moos, A. Moradi, and S. Rasoolzadeh, \u201cThe SPEEDY family of block ciphers engineering an ultra low-latency cipher from gate level for secure processor architectures,\u201d IACR Trans. Cryptogr. Hardw. Embed. Syst., vol.2021, no.4, pp.510-545, 2021. 10.46586\/tches.v2021.i4.510-545","key":"5","DOI":"10.46586\/tches.v2021.i4.510-545"},{"doi-asserted-by":"publisher","unstructured":"[8] C. Dobraunig, M. Eichlseder, D. Kales, and F. Mendel, \u201cPractical key-recovery attack on MANTIS5,\u201d IACR Trans. Symmetric Cryptol., vol.2016, no.2, pp.248-260, 2016. 10.46586\/tosc.v2016.i2.248-260","key":"6","DOI":"10.46586\/tosc.v2016.i2.248-260"},{"doi-asserted-by":"crossref","unstructured":"[9] C. Boura, N. David, R.H. Boissier, and M. Naya-Plasencia, \u201cBetter steady than speedy: Full break of SPEEDY-7-192,\u201d IACR Cryptol. ePrint Arch., p.1351, 2022.","key":"7","DOI":"10.1007\/978-3-031-30634-1_2"},{"doi-asserted-by":"publisher","unstructured":"[10] L. Sun, W. Wang, and M. Wang, \u201cMore accurate differential properties of LED64 and Midori64,\u201d IACR Trans. Symmetric Cryptol., vol.2018, no.3, pp.93-123, 2018. 10.46586\/tosc.v2018.i3.93-123","key":"8","DOI":"10.46586\/tosc.v2018.i3.93-123"},{"doi-asserted-by":"publisher","unstructured":"[11] E. Biham and A. Shamir, \u201cDifferential cryptanalysis of des-like cryptosystems,\u201d J. CRYPTOLOGY, vol.4, no.1, pp.3-72, 1991. 10.1007\/bf00630563","key":"9","DOI":"10.1007\/BF00630563"},{"doi-asserted-by":"crossref","unstructured":"[13] N. Mouha, Q. Wang, D. Gu, and B. Preneel, \u201cDifferential and linear cryptanalysis using mixed-integer linear programming,\u201d Inscrypt, Lecture Notes in Computer Science, vol.7537, pp.57-76, Springer, 2011. 10.1007\/978-3-642-34704-7_5","key":"10","DOI":"10.1007\/978-3-642-34704-7_5"},{"doi-asserted-by":"crossref","unstructured":"[14] R. Ankele and S. K\u00f6lbl, \u201cMind the gap\u2006\u2014\u2006A closer look at the security of block ciphers against differential cryptanalysis,\u201d SAC, Lecture Notes in Computer Science, vol.11349, pp.163-190, Springer, 2018. 10.1007\/978-3-030-10970-7_8","key":"11","DOI":"10.1007\/978-3-030-10970-7_8"},{"doi-asserted-by":"crossref","unstructured":"[15] S. K\u00f6lbl, G. Leander, and T. Tiessen, \u201cObservations on the SIMON block cipher family,\u201d CRYPTO (1), Lecture Notes in Computer Science, vol.9215, pp.161-185, Springer, 2015. 10.1007\/978-3-662-47989-6_8","key":"12","DOI":"10.1007\/978-3-662-47989-6_8"},{"unstructured":"[16] N. Mouha and B. Preneel, \u201cTowards finding optimal differential characteristics for ARX: Application to Salsa20.\u201d Cryptology ePrint Archive, Paper 2013\/328, 2013.","key":"13"},{"doi-asserted-by":"publisher","unstructured":"[17] L. Sun, W. Wang, and M. Wang, \u201cAccelerating the search of differential and linear characteristics with the SAT method,\u201d IACR Trans. Symmetric Cryptol., vol.2021, no.1, pp.269-315, 2021. 10.46586\/tosc.v2021.i1.269-315","key":"14","DOI":"10.46586\/tosc.v2021.i1.269-315"},{"doi-asserted-by":"crossref","unstructured":"[18] J.S. Teh and A. Biryukov, \u201cDifferential cryptanalysis of WARP,\u201d IACR Cryptol. ePrint Arch., p.1641, 2021.","key":"15","DOI":"10.1016\/j.jisa.2022.103316"},{"unstructured":"[19] S. Sun, L. Hu, M. Wang, P. Wang, K. Qiao, X. Ma, D. Shi, L. Song, and K. Fu, \u201cTowards finding the best characteristics of some bit-oriented block ciphers and automatic enumeration of (related-key) differential and linear characteristics with predefined properties,\u201d Cryptology ePrint Archive, Paper 2014\/747, 2014.","key":"16"},{"doi-asserted-by":"crossref","unstructured":"[20] S.A. Cook, \u201cThe complexity of theorem-proving procedures,\u201d STOC, pp.151-158, ACM, 1971. 10.1145\/800157.805047","key":"17","DOI":"10.1145\/800157.805047"},{"doi-asserted-by":"publisher","unstructured":"[21] O. Bailleux and Y. Boufkhad, \u201cEfficient cnf encoding of boolean cardinality constraints,\u201d International Conference on Principles and Practice of Constraint Programming, pp.108-122, Springer, 2003. 10.1007\/978-3-540-45193-8_8","key":"18","DOI":"10.1007\/978-3-540-45193-8_8"},{"unstructured":"[22] V. Vallade, L. Le Frioux, R. Oanea, S. Baarir, J. Sopena, F. Kordon, S. Nejati, and V. Ganesh, \u201cNew concurrent and distributed painless solvers: P-mcomsps, p-mcomsps-com, p-mcomsps-mpi, and p-mcomsps-com-mpi,\u201d SAT COMPETITION 2021, p.40, 2021.","key":"19"},{"doi-asserted-by":"publisher","unstructured":"[23] S. Banik, T. Isobe, F. Liu, K. Minematsu, and K. Sakamoto, \u201cOrthros: A low-latency PRF,\u201d IACR Trans. Symmetric Cryptology, vol.2021, no.1, pp.37-77, 2021. 10.46586\/tosc.v2021.i1.37-77","key":"20","DOI":"10.46586\/tosc.v2021.i1.37-77"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/6\/E108.A_2023EAP1159\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T03:42:47Z","timestamp":1749267767000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/6\/E108.A_2023EAP1159\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,1]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2023eap1159","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"type":"print","value":"0916-8508"},{"type":"electronic","value":"1745-1337"}],"subject":[],"published":{"date-parts":[[2025,6,1]]},"article-number":"2023EAP1159"}}