{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:49:47Z","timestamp":1742924987835,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031533679"},{"type":"electronic","value":"9783031533686"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-53368-6_20","type":"book-chapter","created":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T19:02:15Z","timestamp":1708282935000},"page":"409-428","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parallel SAT Framework to\u00a0Find Clustering of\u00a0Differential Characteristics and\u00a0Its Applications"],"prefix":"10.1007","author":[{"given":"Kosei","family":"Sakamoto","sequence":"first","affiliation":[]},{"given":"Ryoma","family":"Ito","sequence":"additional","affiliation":[]},{"given":"Takanori","family":"Isobe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,19]]},"reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"192","DOI":"10.46586\/tosc.v2019.i1.192-235","volume":"2019","author":"R Ankele","year":"2019","unstructured":"Ankele, R., Dobraunig, C., Guo, J., Lambooij, E., Leander, G., Todo, Y.: Zero-correlation attacks on tweakable block ciphers with linear tweakey expansion. IACR Trans. Symmetric Cryptol. 2019(1), 192\u2013235 (2019)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-030-10970-7_8","volume-title":"SAC 2018","author":"R Ankele","year":"2018","unstructured":"Ankele, R., K\u00f6lbl, S.: Mind the gap - a closer look at the security of block ciphers against differential cryptanalysis. In: Cid, C., Jacobson, M., Jr. (eds.) SAC 2018. LNCS, vol. 11349, pp. 163\u2013190. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_8"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Avanzi, R.: The 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. IACR Trans. Symmetric Cryptol. 2017(1), 4\u201344 (2017)","DOI":"10.46586\/tosc.v2017.i1.4-44"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-45193-8_8","volume-title":"CP 2003","author":"O Bailleux","year":"2003","unstructured":"Bailleux, O., Boufkhad, Y.: Efficient CNF encoding of Boolean cardinality constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 108\u2013122. Springer, Cham (2003). https:\/\/doi.org\/10.1007\/978-3-540-45193-8_8"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-662-48800-3_17","volume-title":"ASIACRYPT 2015","author":"S Banik","year":"2015","unstructured":"Banik, S., et al.: Midori: a block cipher for low energy. In: Iwata, T., Cheon, J. (eds.) ASIACRYPT 2015. LNSC, vol. 9453, pp. 411\u2013436. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_17"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-662-53008-5_5","volume-title":"CRYPTO 2016","author":"C Beierle","year":"2016","unstructured":"Beierle, C., et al.: The SKINNY family of block ciphers and its low-latency variant MANTIS. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNSC, vol. 9815, pp. 123\u2013153. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_5"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-38424-3_1","volume-title":"CRYPTO 1990","author":"E Biham","year":"1990","unstructured":"Biham, E., Shamir, A.: Differential cryptanalysis of des-like cryptosystems. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 2\u201321. Springer, Cham (1990). https:\/\/doi.org\/10.1007\/3-540-38424-3_1"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-662-46706-0_28","volume-title":"FSE 2014","author":"A Biryukov","year":"2014","unstructured":"Biryukov, A., Roy, A., Velichkov, V.: Differential analysis of block ciphers SIMON and SPECK. In: Cid, C., Rechberger, C. (eds.) FSE 2014. LNSC, vol. 8540, pp. 546\u2013570. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-46706-0_28"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-34961-4_14","volume-title":"ASIACRYPT 2012","author":"J Borghoff","year":"2012","unstructured":"Borghoff, J., et al.: PRINCE - a low-latency block cipher for pervasive computing applications - extended abstract. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNSC, vol. 7658, pp. 208\u2013225. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_14"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Boura, C., David, N., Boissier, R.H., Naya-Plasencia, M.: Better steady than speedy: full break of SPEEDY-7-192. IACR Cryptology ePrint Archive, p. 1351 (2022)","DOI":"10.1007\/978-3-031-30634-1_2"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-030-81652-0_19","volume-title":"SAC 2020","author":"D Bozilov","year":"2020","unstructured":"Bozilov, D., et al.: PRINCEv2 - more security for (almost) no overhead. In: Dunkelman, O., Jacobson, M.J., Jr., O\u2019Flynn, C. (eds.) SAC 2020. LNSC, vol. 12804, pp. 483\u2013511. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_19"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-662-46706-0_30","volume-title":"FSE 2014","author":"A Canteaut","year":"2014","unstructured":"Canteaut, A., Fuhr, T., Gilbert, H., Naya-Plasencia, M., Reinhard, J.: Multiple differential cryptanalysis of round-reduced PRINCE. In: Cid, C., Rechberger, C. (eds.) FSE 2014. LNSC, vol. 8540, pp. 591\u2013610. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-46706-0_30"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: STOC, pp. 151\u2013158. ACM (1971)","DOI":"10.1145\/800157.805047"},{"issue":"4","key":"20_CR14","first-page":"1041","volume":"33","author":"Y Ding","year":"2017","unstructured":"Ding, Y., Zhao, J., Li, L., Yu, H.: Impossible differential analysis on round-reduced PRINCE. J. Inf. Sci. Eng. 33(4), 1041\u20131053 (2017)","journal-title":"J. Inf. Sci. Eng."},{"issue":"2","key":"20_CR15","first-page":"248","volume":"2016","author":"C Dobraunig","year":"2016","unstructured":"Dobraunig, C., Eichlseder, M., Kales, D., Mendel, F.: Practical key-recovery attack on MANTIS5. IACR Trans. Symmetric Cryptol. 2016(2), 248\u2013260 (2016)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11499107_5","volume-title":"SAT 2005","author":"N E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNTCS, vol. 3569, pp. 61\u201375. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11499107_5"},{"issue":"1","key":"20_CR17","doi-asserted-by":"publisher","first-page":"64","DOI":"10.46586\/tosc.v2022.i1.64-87","volume":"2022","author":"J Erlacher","year":"2022","unstructured":"Erlacher, J., Mendel, F., Eichlseder, M.: Bounds for the security of ascon against differential and linear cryptanalysis. IACR Trans. Symmetric Cryptol. 2022(1), 64\u201387 (2022)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-662-47989-6_8","volume-title":"CRYPTO 2015","author":"S K\u00f6lbl","year":"2015","unstructured":"K\u00f6lbl, S., Leander, G., Tiessen, T.: Observations on the SIMON block cipher family. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNSC, vol. 9215, pp. 161\u2013185. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_8"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-319-55714-4_6","volume-title":"LightSec 2016","author":"S K\u00f6lbl","year":"2016","unstructured":"K\u00f6lbl, S., Roy, A.: A brief comparison of simon and simeck. In: Bogdanov, A. (ed.) LightSec 2016. LNSC, vol. 10098, pp. 69\u201388. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-55714-4_6"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-46416-6_2","volume-title":"EUROCRYPT 1991","author":"X Lai","year":"1991","unstructured":"Lai, X., Massey, J.L., Murphy, S.: Markov ciphers and differential cryptanalysis. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 17\u201338. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_2"},{"issue":"4","key":"20_CR21","doi-asserted-by":"publisher","first-page":"510","DOI":"10.46586\/tches.v2021.i4.510-545","volume":"2021","author":"G Leander","year":"2021","unstructured":"Leander, G., Moos, T., Moradi, A., Rasoolzadeh, S.: The SPEEDY family of block ciphers engineering an ultra low-latency cipher from gate level for secure processor architectures. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(4), 510\u2013545 (2021)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"issue":"1","key":"20_CR22","doi-asserted-by":"publisher","first-page":"236","DOI":"10.46586\/tosc.v2019.i1.236-263","volume":"2019","author":"M Li","year":"2019","unstructured":"Li, M., Hu, K., Wang, M.: Related-tweak statistical saturation cryptanalysis and its application on QARMA. IACR Trans. Symmetric Cryptol. 2019(1), 236\u2013263 (2019)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"20_CR23","doi-asserted-by":"publisher","first-page":"8361","DOI":"10.1109\/ACCESS.2020.2964259","volume":"8","author":"Y Liu","year":"2020","unstructured":"Liu, Y., Zang, T., Gu, D., Zhao, F., Li, W., Liu, Z.: Improved cryptanalysis of reduced-version QARMA-64\/128. IEEE Access 8, 8361\u20138370 (2020)","journal-title":"IEEE Access"},{"key":"20_CR24","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/BFb0053451","volume-title":"EUROCRYPT 1994","author":"M Matsui","year":"1994","unstructured":"Matsui, M.: On correlation between the order of S-boxes and the strength of DES. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 366\u2013375. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0053451"},{"key":"20_CR25","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/11564751_73","volume-title":"CP 2005","author":"C Sinz","year":"2005","unstructured":"Sinz, C.: Towards an optimal CNF encoding of Boolean cardinality constraints. In: van Beek, P. (ed.) CP 2005. LNPSE, vol. 3709, pp. 827\u2013831. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564751_73"},{"issue":"3","key":"20_CR26","doi-asserted-by":"publisher","first-page":"93","DOI":"10.46586\/tosc.v2018.i3.93-123","volume":"2018","author":"L Sun","year":"2018","unstructured":"Sun, L., Wang, W., Wang, M.: More accurate differential properties of LED64 and Midori64. IACR Trans. Symmetric Cryptol. 2018(3), 93\u2013123 (2018)","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"1","key":"20_CR27","doi-asserted-by":"publisher","first-page":"269","DOI":"10.46586\/tosc.v2021.i1.269-315","volume":"2021","author":"L Sun","year":"2021","unstructured":"Sun, L., Wang, W., Wang, M.: Accelerating the search of differential and linear characteristics with the SAT method. IACR Trans. Symmetric Cryptol. 2021(1), 269\u2013315 (2021)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"20_CR28","unstructured":"Yang, D., Qi, W., Chen, H.: Impossible differential attack on QARMA family of block ciphers. IACR Cryptology ePrint Archive, p. 334 (2018)"},{"key":"20_CR29","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-662-48324-4_16","volume-title":"CHES 2015","author":"G Yang","year":"2015","unstructured":"Yang, G., Zhu, B., Suder, V., Aagaard, M.D., Gong, G.: The Simeck family of lightweight block ciphers. In: G\u00fcneysu, T., Handschuh, H. (eds.) CHES 2015. LNSC, vol. 9293, pp. 307\u2013329. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48324-4_16"},{"key":"20_CR30","doi-asserted-by":"publisher","first-page":"153683","DOI":"10.1109\/ACCESS.2019.2946638","volume":"7","author":"R Zong","year":"2019","unstructured":"Zong, R., Dong, X.: MILP-aided related-tweak\/key impossible differential attack and its applications to QARMA, Joltik-BC. IEEE Access 7, 153683\u2013153693 (2019)","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53368-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T19:03:49Z","timestamp":1708283029000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53368-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031533679","9783031533686"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53368-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fredericton, NB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sac-workshop.github.io\/sac-2023\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.09","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.56","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}