{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:44:54Z","timestamp":1767321894865,"version":"3.48.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032105356","type":"print"},{"value":"9783032105363","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-10536-3_2","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:41:31Z","timestamp":1767321691000},"page":"26-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Collision Attacks on\u00a0SPONGENT with\u00a0Grouping Method"],"prefix":"10.1007","author":[{"given":"Keita","family":"Toyama","sequence":"first","affiliation":[]},{"given":"Kosei","family":"Sakamoto","sequence":"additional","affiliation":[]},{"given":"Takanori","family":"Isobe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-37682-5_26","volume-title":"Information Security and Cryptology \u2013 ICISC 2012","author":"MA Abdelraheem","year":"2013","unstructured":"Abdelraheem, M.A.: Estimating the probabilities of low-weight differential and linear approximations on PRESENT-like ciphers. In: Kwon, T., Lee, M.-K., Kwon, D. (eds.) ICISC 2012. LNCS, vol. 7839, pp. 368\u2013382. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37682-5_26"},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/S00145-012-9125-6","volume":"26","author":"J Aumasson","year":"2013","unstructured":"Aumasson, J., Henzen, L., Meier, W., Naya-Plasencia, M.: Quark: a lightweight hash. J. Cryptol. 26(2), 313\u2013339 (2013). https:\/\/doi.org\/10.1007\/S00145-012-9125-6","journal-title":"J. Cryptol."},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Bellini, E., et al.: CLAASP: a cryptographic library for the automated analysis of symmetric primitives. In: Carlet, C., Mandal, K., Rijmen, V. (eds.) Selected Areas in Cryptography - SAC 2023 - 30th International Conference, Fredericton, Canada, 14\u201318 August 2023, Revised Selected Papers. LNCS, vol. 14201, pp. 387\u2013408. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-53368-6_19","DOI":"10.1007\/978-3-031-53368-6_19"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bellini, E., et al.: Differential cryptanalysis with SAT, SMT, MILP, and CP: a detailed comparison for bit-oriented primitives. Cryptology ePrint Archive, Paper 2024\/105 (2024)","DOI":"10.1007\/978-981-99-7563-1_13"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF00630563","volume":"4","author":"E Biham","year":"1991","unstructured":"Biham, E., Shamir, A.: Differential cryptanalysis of DES-like cryptosystems. J. Cryptol. 4(1), 3\u201372 (1991). https:\/\/doi.org\/10.1007\/BF00630563","journal-title":"J. Cryptol."},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-23951-9_21","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"A Bogdanov","year":"2011","unstructured":"Bogdanov, A., Kne\u017eevi\u0107, M., Leander, G., Toz, D., Var\u0131c\u0131, K., Verbauwhede, I.: spongent: a lightweight hash function. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 312\u2013325. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_21"},{"issue":"10","key":"2_CR7","doi-asserted-by":"publisher","first-page":"2041","DOI":"10.1109\/TC.2012.196","volume":"62","author":"A Bogdanov","year":"2013","unstructured":"Bogdanov, A., Knezevic, M., Leander, G., Toz, D., Varici, K., Verbauwhede, I.: SPONGENT: the design space of lightweight cryptographic hashing. IEEE Trans. Computers 62(10), 2041\u20132053 (2013). https:\/\/doi.org\/10.1109\/TC.2012.196","journal-title":"IEEE Trans. Computers"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-540-74735-2_31","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2007","author":"A Bogdanov","year":"2007","unstructured":"Bogdanov, A.: PRESENT: an ultra-lightweight block cipher. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 450\u2013466. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74735-2_31"},{"key":"2_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-2821-6","volume-title":"Logic Minimization Algorithms for VLSI Synthesis, The Kluwer International Series in Engineering and Computer Science","author":"RK Brayton","year":"1984","unstructured":"Brayton, R.K., Hachtel, G.D., McMullen, C.T., Sangiovanni-Vincentelli, A.L.: Logic Minimization Algorithms for VLSI Synthesis, The Kluwer International Series in Engineering and Computer Science, vol. 2. Springer, New York (1984). https:\/\/doi.org\/10.1007\/978-1-4613-2821-6"},{"issue":"1","key":"2_CR10","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":"2_CR11","doi-asserted-by":"publisher","unstructured":"Gilbert, H., Peyrin, T.: Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations. In: Hong, S., Iwata, T. (eds.) FSE 2010. LNCS, vol. 6147, pp. 365\u2013383. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13858-4_21","DOI":"10.1007\/978-3-642-13858-4_21"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-22792-9_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"J Guo","year":"2011","unstructured":"Guo, J., Peyrin, T., Poschmann, A.: The PHOTON family of lightweight hash functions. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 222\u2013239. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_13"},{"key":"2_CR13","unstructured":"International Organization for Standardization: ISO\/IEC 29192-2:2019 - information security \u2013 lightweight cryptography \u2013 part 2: Block ciphers (2019). https:\/\/www.iso.org\/standard\/67173.html"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-34047-5_7","volume-title":"Fast Software Encryption","author":"J Jean","year":"2012","unstructured":"Jean, J., Naya-Plasencia, M., Peyrin, T.: Improved rebound attack on the finalist Gr\u00f8stl. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol. 7549, pp. 110\u2013126. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34047-5_7"},{"key":"2_CR15","doi-asserted-by":"publisher","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","DOI":"10.1007\/3-540-46416-6_2"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Libralesso, L., Delobel, F., Lafourcade, P., Solnon, C.: Automatic generation of declarative models for differential cryptanalysis. In: Michel, L.D. (ed.) 27th International Conference on Principles and Practice of Constraint Programming, CP 2021, Montpellier, France (Virtual Conference), 25\u201329 October 2021. LIPIcs, vol.\u00a0210, pp. 40:1\u201340:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPICS.CP.2021.40","DOI":"10.4230\/LIPICS.CP.2021.40"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-030-56877-1_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"F Liu","year":"2020","unstructured":"Liu, F., Isobe, T., Meier, W.: Automatic verification of differential characteristics: application to reduced Gimli. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part III. LNCS, vol. 12172, pp. 219\u2013248. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_8"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-319-39555-5_26","volume-title":"Applied Cryptography and Network Security","author":"Y Liu","year":"2016","unstructured":"Liu, Y., Wang, Q., Rijmen, V.: Automatic search of linear trails in ARX with applications to SPECK and Chaskey. In: Manulis, M., Sadeghi, A.-R., Schneider, S. (eds.) ACNS 2016. LNCS, vol. 9696, pp. 485\u2013499. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39555-5_26"},{"issue":"1","key":"2_CR19","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1186\/S42400-021-00108-3","volume":"5","author":"X Lu","year":"2022","unstructured":"Lu, X., Li, B., Liu, M., Lin, D.: Improved conditional differential attacks on lightweight hash family QUARK. Cybersecur. 5(1), 12 (2022). https:\/\/doi.org\/10.1186\/S42400-021-00108-3","journal-title":"Cybersecur."},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Martins, R., Joshi, S., Manquinho, V.M., Lynce, I.: Incremental cardinality constraints for MaxSAT. CoRR abs\/1408.4628 (2014)","DOI":"10.1007\/978-3-319-10428-7_39"},{"issue":"6","key":"2_CR21","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1002\/j.1538-7305.1956.tb03835.x","volume":"35","author":"EJ McCluskey","year":"1956","unstructured":"McCluskey, E.J.: Minimization of Boolean functions. Bell Syst. Tech. J. 35(6), 1417\u20131444 (1956)","journal-title":"Bell Syst. Tech. J."},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-03317-9_16","volume-title":"Fast Software Encryption","author":"F Mendel","year":"2009","unstructured":"Mendel, F., Rechberger, C., Schl\u00e4ffer, M., Thomsen, S.S.: The rebound attack: cryptanalysis of reduced whirlpool and Grostl. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol. 5665, pp. 260\u2013276. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03317-9_16"},{"key":"2_CR23","unstructured":"Mouha, N., Preneel, B.: A proof that the ARX cipher salsa20 is secure against differential cryptanalysis. IACR Cryptol. ePrint Arch. p.\u00a0328 (2013)"},{"issue":"8","key":"2_CR24","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1080\/00029890.1952.11988183","volume":"59","author":"WV Quine","year":"1952","unstructured":"Quine, W.V.: The problem of simplifying truth functions. Am. Math. Mon. 59(8), 521\u2013531 (1952)","journal-title":"Am. Math. Mon."},{"issue":"9","key":"2_CR25","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1080\/00029890.1955.11988710","volume":"62","author":"WV Quine","year":"1955","unstructured":"Quine, W.V.: A way to simplify truth functions. Am. Math. Mon. 62(9), 627\u2013631 (1955)","journal-title":"Am. Math. Mon."},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Ranea, A., Rijmen, V.: Characteristic automated search of cryptographic algorithms for distinguishing attacks (CASCADA). IET Inf. Secur. 16(6), 470\u2013481 (2022). https:\/\/doi.org\/10.1049\/ise2.12077. https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/abs\/10.1049\/ise2.12077","DOI":"10.1049\/ise2.12077"},{"issue":"2","key":"2_CR27","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1049\/ISE2.12044","volume":"16","author":"R Shiba","year":"2022","unstructured":"Shiba, R., Sakamoto, K., Liu, F., Minematsu, K., Isobe, T.: Integral and impossible-differential attacks on the reduced-round Lesamnta-LW-BC. IET Inf. Secur. 16(2), 75\u201385 (2022). https:\/\/doi.org\/10.1049\/ISE2.12044","journal-title":"IET Inf. Secur."},{"issue":"3","key":"2_CR28","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":"2_CR29","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":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-319-76953-0_15","volume-title":"Topics in Cryptology \u2013 CT-RSA 2018","author":"Q Wang","year":"2018","unstructured":"Wang, Q., Grassi, L., Rechberger, C.: Zero-sum partitions of PHOTON permutations. In: Smart, N.P. (ed.) CT-RSA 2018. LNCS, vol. 10808, pp. 279\u2013299. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76953-0_15"},{"key":"2_CR31","unstructured":"Zhang, G., Liu, M.: A distinguisher on present-like permutations with application to SPONGENT. IACR Cryptol. ePrint Arch.,\u00a0236 (2016). http:\/\/eprint.iacr.org\/2016\/236"},{"issue":"7","key":"2_CR32","doi-asserted-by":"publisher","first-page":"72101","DOI":"10.1007\/S11432-016-0165-6","volume":"60","author":"G Zhang","year":"2017","unstructured":"Zhang, G., Liu, M.: A distinguisher on present-like permutations with application to SPONGENT. Sci. China Inf. Sci. 60(7), 72101 (2017). https:\/\/doi.org\/10.1007\/S11432-016-0165-6","journal-title":"Sci. China Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-10536-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:41:32Z","timestamp":1767321692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-10536-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032105356","9783032105363"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-10536-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","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":"Toronto, ON","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sacworkshop.org\/SAC25\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}