{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:56:45Z","timestamp":1775145405657,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":36,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819750276","type":"print"},{"value":"9789819750283","type":"electronic"}],"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-981-97-5028-3_2","type":"book-chapter","created":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T16:02:12Z","timestamp":1721059332000},"page":"24-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Automatic Quantum Multi-collision Distinguishers and\u00a0Rebound Attacks with\u00a0Triangulation Algorithm"],"prefix":"10.1007","author":[{"given":"Zhenzhen","family":"Bao","sequence":"first","affiliation":[]},{"given":"Jian","family":"Guo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7663-8321","authenticated-orcid":false,"given":"Shun","family":"Li","sequence":"additional","affiliation":[]},{"given":"Phuong","family":"Pham","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,16]]},"reference":[{"issue":"5","key":"2_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-022-03499-5","volume":"21","author":"S Baek","year":"2022","unstructured":"Baek, S., Cho, S., Kim, J.: Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions. Quant. Inf. Process. 21(5), 1\u201332 (2022)","journal-title":"Quant. Inf. Process."},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-03356-8_14","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"A Biryukov","year":"2009","unstructured":"Biryukov, A., Khovratovich, D., Nikoli\u0107, I.: Distinguisher and related-key attack on the full AES-256. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 231\u2013249. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_14"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-642-13190-5_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"A Biryukov","year":"2010","unstructured":"Biryukov, A., Nikoli\u0107, I.: Automatic search for related-key differential characteristics in byte-oriented block ciphers: application to AES, Camellia, Khazad and others. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 322\u2013344. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_17"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-25385-0_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random Oracles in a quantum world. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 41\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BFb0054319","volume-title":"LATIN\u201998: Theoretical Informatics","author":"G Brassard","year":"1998","unstructured":"Brassard, G., H\u00d8yer, P., Tapp, A.: Quantum cryptanalysis of hash and claw-free functions. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 163\u2013169. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054319"},{"key":"2_CR6","unstructured":"Canteaut, A., et al.: A note on related-key attacks on Saturnin (2020). https:\/\/project.inria.fr\/saturnin\/files\/2020\/11\/Note-RK-1.pdf"},{"issue":"S1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"160","DOI":"10.46586\/tosc.v2020.iS1.160-207","volume":"2020","author":"A Canteaut","year":"2020","unstructured":"Canteaut, A., et al.: Saturnin: a suite of lightweight symmetric algorithms for post-quantum security. IACR Trans. Symmetric Cryptol. 2020(S1), 160\u2013207 (2020)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-319-70697-9_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"A Chailloux","year":"2017","unstructured":"Chailloux, A., Naya-Plasencia, M., Schrottenloher, A.: An efficient quantum collision search algorithm and implications on symmetric cryptography. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, Part II. LNCS, vol. 10625, pp. 211\u2013240. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_8"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael: AES - The Advanced Encryption Standard. Information Security and Cryptography. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-3-662-04722-4","DOI":"10.1007\/978-3-662-04722-4"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Dong, X., Guo, J., Li, S., Pham, P.: Triangulating rebound attack on AES-like hashing. In: Dodis, Y., Shrimpton, T. (eds.) Proceedings of the 42nd Annual International Cryptology Conference on Advances in Cryptology, CRYPTO 2022, Part I. LNCS, Santa Barbara, CA, USA, 15\u201318 August 2022, vol. 13507, pp. 94\u2013124. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_4","DOI":"10.1007\/978-3-031-15802-5_4"},{"key":"2_CR11","unstructured":"Dong, X., Li, S., Pham, P.: Chosen-key distinguishing attacks on full AES-192, AES-256, Kiasu-BC, and more. IACR Cryptology ePrint Archive, Paper 2023\/1095 (2023). https:\/\/eprint.iacr.org\/2023\/1095"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/978-3-030-64834-3_25","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"X Dong","year":"2020","unstructured":"Dong, X., Sun, S., Shi, D., Gao, F., Wang, X., Hu, L.: Quantum collision attacks on AES-like hashing with low quantum random access memories. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part II. LNCS, vol. 12492, pp. 727\u2013757. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_25"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-40041-4_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"P-A Fouque","year":"2013","unstructured":"Fouque, P.-A., Jean, J., Peyrin, T.: Structural evaluation of AES and chosen-key distinguisher of 9-round. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 183\u2013203. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_11"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-319-49890-4_16","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2016","author":"D G\u00e9rault","year":"2016","unstructured":"G\u00e9rault, D., Lafourcade, P.: Related-key cryptanalysis of Midori. In: Dunkelman, O., Sanadhya, S.K. (eds.) INDOCRYPT 2016. LNCS, vol. 10095, pp. 287\u2013304. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49890-4_16"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Miller, G.L. (ed.) Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, 22\u201324 May 1996, pp. 212\u2013219. ACM (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"G\u00e9rault, D., Lafourcade, P., Minier, M., Solnon, C.: Computing AES related-key differential characteristics with constraint programming. Artif. Intell. 278, 103183 (2020). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0004370218303631","DOI":"10.1016\/j.artint.2019.103183"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/978-3-319-44953-1_37","volume-title":"Principles and Practice of Constraint Programming","author":"D Gerault","year":"2016","unstructured":"Gerault, D., Minier, M., Solnon, C.: Constraint programming models for chosen key differential cryptanalysis. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 584\u2013601. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44953-1_37"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-030-45724-2_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Hosoyamada","year":"2020","unstructured":"Hosoyamada, A., Sasaki, Yu.: Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part II. LNCS, vol. 12106, pp. 249\u2013279. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_9"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Hosoyamada, A., Sasaki, Y.: Quantum collision attacks on reduced SHA-256 and SHA-512. Cryptology ePrint Archive, Report 2021\/292 (2021). https:\/\/eprint.iacr.org\/2021\/292","DOI":"10.1007\/978-3-030-84242-0_22"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-662-53008-5_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"M Kaplan","year":"2016","unstructured":"Kaplan, M., Leurent, G., Leverrier, A., Naya-Plasencia, M.: Breaking symmetric cryptosystems using\u00a0quantum\u00a0period finding. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part II. LNCS, vol. 9815, pp. 207\u2013237. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_8"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-00862-7_11","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"D Khovratovich","year":"2009","unstructured":"Khovratovich, D., Biryukov, A., Nikolic, I.: Speeding up collision search for byte-oriented hash functions. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 164\u2013181. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00862-7_11"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Kumar\u00a0Chauhan, A., Kumar, A., Kumar\u00a0Sanadhya, S.: Quantum free-start collision attacks on double block length hashing with round-reduced AES-256. IACR Trans. Symmetric Cryptol. 2021(1), 316\u2013336 (2021), https:\/\/tosc.iacr.org\/index.php\/ToSC\/article\/view\/8841","DOI":"10.46586\/tosc.v2021.i1.316-336"},{"key":"2_CR23","unstructured":"Kuwakado, H., Morii, M.: Security on the quantum-type Even-Mansour cipher, pp. 312\u2013316, January 2012"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Kuwakado, H., Morii, M.: Quantum distinguisher between the 3-round Feistel cipher and the random permutation. In: 2010 IEEE International Symposium on Information Theory, pp. 2682\u20132685 (2010)","DOI":"10.1109\/ISIT.2010.5513654"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-70697-9_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"G Leander","year":"2017","unstructured":"Leander, G., May, A.: Grover meets Simon \u2013 quantumly attacking the FX-construction. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, Part II. LNCS, vol. 10625, pp. 161\u2013178. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_6"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Li, S., Liu, G., Pham, P.: Rebound attacks on SFSKINNY hashing with automatic tools. In: Yuan, X., Bai, G., Alcaraz, C., Majumdar, S. (eds.) Proceedings of the 16th International Conference on Network and System Security, NSS 2022, Denarau Island, Fiji, 9\u201312 December 2022. LNCS, vol. 13787, pp. 649\u2013666. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-23020-2_37","DOI":"10.1007\/978-3-031-23020-2_37"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-030-17659-4_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"Q Liu","year":"2019","unstructured":"Liu, Q., Zhandry, M.: On finding quantum multi-collisions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part III. LNCS, vol. 11478, pp. 189\u2013218. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_7"},{"key":"2_CR28","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 Gr\u00f8stl. 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_CR29","unstructured":"National Institute for Standards and Technology, USA: Post-Quantum Cryptography Standardization (2017). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-540-85093-9_22","volume-title":"Information Theoretic Security","author":"J Patarin","year":"2008","unstructured":"Patarin, J.: A proof of security in O(2n) for the Xor of Two Random Permutations. In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol. 5155, pp. 232\u2013248. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85093-9_22"},{"issue":"3","key":"2_CR31","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01933667","volume":"15","author":"JM Pollard","year":"1975","unstructured":"Pollard, J.M.: A Monte Carlo method for factorization. BIT Numer. Math. 15(3), 331\u2013334 (1975). https:\/\/doi.org\/10.1007\/BF01933667","journal-title":"BIT Numer. Math."},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA, 20\u201322 November 1994, pp. 124\u2013134. IEEE Computer Society Press (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"5","key":"2_CR33","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"DR Simon","year":"1997","unstructured":"Simon, D.R.: On the power of quantum computation. SIAM J. Comput. 26(5), 1474\u20131483 (1997). https:\/\/doi.org\/10.1137\/S0097539796298637","journal-title":"SIAM J. Comput."},{"issue":"1","key":"2_CR34","doi-asserted-by":"publisher","first-page":"281","DOI":"10.46586\/tosc.v2017.i1.281-306","volume":"2017","author":"S Sun","year":"2017","unstructured":"Sun, S., et al.: Analysis of AES, SKINNY, and others with constraint programming. IACR Trans. Symmetric Cryptol. 2017(1), 281\u2013306 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"2_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/11927587_5","volume-title":"Information Security and Cryptology \u2013 ICISC 2006","author":"K Suzuki","year":"2006","unstructured":"Suzuki, K., Tonien, D., Kurosawa, K., Toyota, K.: Birthday paradox for multi-collisions. In: Rhee, M.S., Lee, B. (eds.) ICISC 2006. LNCS, vol. 4296, pp. 29\u201340. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11927587_5"},{"issue":"1","key":"2_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"PC van Oorschot","year":"1999","unstructured":"van Oorschot, P.C., Wiener, M.J.: Parallel Collision Search with Cryptanalytic Applications. J. Cryptol. 12(1), 1\u201328 (1999)","journal-title":"J. Cryptol."}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-5028-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T05:07:57Z","timestamp":1732424877000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-5028-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819750276","9789819750283"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-5028-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACISP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Conference on Information Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acisp2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.acisp24.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}