{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T08:35:40Z","timestamp":1775810140094,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319706962","type":"print"},{"value":"9783319706979","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-70697-9_7","type":"book-chapter","created":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T18:27:49Z","timestamp":1510943269000},"page":"179-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Quantum Multicollision-Finding Algorithm"],"prefix":"10.1007","author":[{"given":"Akinori","family":"Hosoyamada","sequence":"first","affiliation":[]},{"given":"Yu","family":"Sasaki","sequence":"additional","affiliation":[]},{"given":"Keita","family":"Xagawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,18]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.4086\/toc.2005.v001a003","volume":"1","author":"A Ambainis","year":"2005","unstructured":"Ambainis, A.: Polynomial degree and lower bounds in quantum complexity: collision and element distinctness with small range. Theory Comput. 1, 37\u201346 (2005). https:\/\/arxiv.org\/abs\/quant-ph\/0305179v3","journal-title":"Theory Comput."},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0097539705447311","volume":"37","author":"A Ambainis","year":"2007","unstructured":"Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM J. Comput. 37(1), 210\u2013239 (2007). The preliminary version appeared in FOCS 2004. See https:\/\/arxiv.org\/abs\/quant-ph\/0311001","journal-title":"SIAM J. Comput."},{"issue":"4","key":"7_CR3","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1145\/1008731.1008735","volume":"51","author":"S Aaronson","year":"2004","unstructured":"Aaronson, S., Shi, Y.: Quantum lower bounds for the collision and the element distinctness problems. J. ACM 51(4), 595\u2013605 (2004)","journal-title":"J. ACM"},{"issue":"4\u20135","key":"7_CR4","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortsch. Phys. 46(4\u20135), 493\u2013505 (1998). https:\/\/arxiv.org\/abs\/quant-ph\/9605034","journal-title":"Fortsch. Phys."},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Belovs, A., Childs, A.M., Jeffery, S., Kothari, R., Magniez, F.: Time-efficient quantum walks for 3-distinctness. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 105\u2013122. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39206-1_10. See http:\/\/arxiv.org\/abs\/1302.3143 and http:\/\/arxiv.org\/abs\/1302.7316","DOI":"10.1007\/978-3-642-39206-1_10"},{"key":"7_CR6","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. https:\/\/eprint.iacr.org\/2010\/428"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Belovs, A.: Learning-graph-based quantum algorithm for \n$$k$$\n-distinctness. In: FOCS 2012, pp. 207\u2013216 (2012). https:\/\/arxiv.org\/abs\/1205.1534v2","DOI":"10.1109\/FOCS.2012.18"},{"key":"7_CR8","unstructured":"Bernstein, D.J.: Cost analysis of hash collisions: will quantum computers make SHARCS obsolete? In: SHARCS 2009 (2009)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Brassard, G., H\u00f8yer, P., Tapp, A.: Quantum algorithm for the collision problem. CoRR, quant-ph\/9705002 (1997). See also Quantum cryptanalysis of hash and claw-free functions. In: LATIN 1998, pp. 163\u2013169 (1998). See https:\/\/arxiv.org\/abs\/quant-ph\/9705002","DOI":"10.1007\/BFb0054319"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-540-71039-4_27","volume-title":"Fast Software Encryption","author":"D Chang","year":"2008","unstructured":"Chang, D., Nandi, M.: Improved indifferentiability security analysis of chopMD hash function. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 429\u2013443. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-71039-4_27"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-662-45611-8_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"I Dinur","year":"2014","unstructured":"Dinur, I., Dunkelman, O., Keller, N., Shamir, A.: Cryptanalysis of iterated even-mansour schemes with two keys. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 439\u2013457. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_23"},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1145\/321420.321422","volume":"14","author":"RW Floyd","year":"1967","unstructured":"Floyd, R.W.: Nondeterministic algorithms. J. ACM 14(4), 636\u2013644 (1967)","journal-title":"J. ACM"},{"key":"7_CR13","unstructured":"Grover, L., Rudolph, T.: How significant are the known collision and element distinctness quantum algorithms? CoRR, quant-ph\/0309123 (2003). See GR04"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: STOC 1996, pp. 212\u2013219 (1996). https:\/\/arxiv.org\/abs\/quant-ph\/9605043","DOI":"10.1145\/237814.237866"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-24209-0_10","volume-title":"Information Security and Cryptology - ICISC 2010","author":"S Hirose","year":"2011","unstructured":"Hirose, S., Ideguchi, K., Kuwakado, H., Owada, T., Preneel, B., Yoshida, H.: A lightweight 256-bit hash function for hardware and low-end devices: Lesamnta-LW. In: Rhee, K.-H., Nyang, D.H. (eds.) ICISC 2010. LNCS, vol. 6829, pp. 151\u2013168. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24209-0_10"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-662-49384-7_15","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"A H\u00fclsing","year":"2016","unstructured":"H\u00fclsing, A., Rijneveld, J., Song, F.: Mitigating multi-target attacks in hash-based signatures. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016. LNCS, vol. 9614, pp. 387\u2013416. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49384-7_15"},{"key":"7_CR17","unstructured":"Jeffery, S.: Frameworks for Quantum Algorithms. Ph.D. thesis, University of Waterloo (2014)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-45661-9_19","volume-title":"Fast Software Encryption","author":"\u00c9 Jaulmes","year":"2002","unstructured":"Jaulmes, \u00c9., Joux, A., Valette, F.: On the security of randomized CBC-MAC beyond the birthday paradox limit a new construction. In: Daemen, J., Rijmen, V. (eds.) FSE 2002. LNCS, vol. 2365, pp. 237\u2013251. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45661-9_19"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-642-10366-7_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"A Joux","year":"2009","unstructured":"Joux, A., Lucks, S.: Improved generic algorithms for 3-collisions. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 347\u2013363. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_21. https:\/\/eprint.iacr.org\/2009\/305"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-662-45611-8_5","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"P Jovanovic","year":"2014","unstructured":"Jovanovic, P., Luykx, A., Mennink, B.: Beyond 2\n            c\/2 security in sponge-based authenticated encryption modes. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 85\u2013104. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_5. https:\/\/eprint.iacr.org\/2014\/373"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-01001-9_6","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"LR Knudsen","year":"2009","unstructured":"Knudsen, L.R., Mendel, F., Rechberger, C., Thomsen, S.S.: Cryptanalysis of MDC-2. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 106\u2013120. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_6"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"29","DOI":"10.4086\/toc.2005.v001a002","volume":"1","author":"S Kutin","year":"2005","unstructured":"Kutin, S.: Quantum lower bound for the collision problem with small range. Theory Comput. 1, 29\u201336 (2005). https:\/\/arxiv.org\/abs\/quant-ph\/0304162","journal-title":"Theory Comput."},{"key":"7_CR23","unstructured":"Mendel, F., Thomsen, S.S.: An observation on JH-512 (2008). http:\/\/ehash.iaik.tugraz.at\/uploads\/d\/da\/Jh_preimage.pdf"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-319-10879-7_20","volume-title":"Security and Cryptography for Networks","author":"Y Naito","year":"2014","unstructured":"Naito, Y., Ohta, K.: Improved indifferentiable security analysis of PHOTON. In: Abdalla, M., Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 340\u2013357. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10879-7_20"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/978-3-662-53887-6_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"I Nikoli\u0107","year":"2016","unstructured":"Nikoli\u0107, I., Sasaki, Y.: A new algorithm for the unbalanced meet-in-the-middle problem. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 627\u2013647. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_23"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-41383-4_6","volume-title":"Advances in Information and Computer Security","author":"Y Naito","year":"2013","unstructured":"Naito, Y., Sasaki, Y., Wang, L., Yasuda, K.: Generic state-recovery and forgery attacks on ChopMD-MAC and on NMAC\/HMAC. In: Sakiyama, K., Terada, M. (eds.) IWSEC 2013. LNCS, vol. 8231, pp. 83\u201398. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41383-4_6"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-662-43933-3_7","volume-title":"Fast Software Encryption","author":"I Nikoli\u0107","year":"2014","unstructured":"Nikoli\u0107, I., Wang, L., Wu, S.: Cryptanalysis of round-reduced LED. In: Moriai, S. (ed.) FSE 2013. LNCS, vol. 8424, pp. 112\u2013129. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43933-3_7"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-62494-5_6","volume-title":"Security Protocols","author":"RL Rivest","year":"1997","unstructured":"Rivest, R.L., Shamir, A.: PayWord and MicroMint: two simple micropayment schemes. In: Lomas, M. (ed.) Security Protocols 1996. LNCS, vol. 1189, pp. 69\u201387. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62494-5_6"},{"key":"7_CR29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814549","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"V Shoup","year":"2008","unstructured":"Shoup, V.: A Computational Introduction to Number Theory and Algebra, 2nd edn. Cambridge University Press, Cambridge (2008)","edition":"2"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Suzuki, K., Tonien, D., Kurosawa, K., Toyota, K.: Birthday paradox for multi-collisions. IEICE Trans. 91-A(1), 39\u201345 (2008). The preliminary version is in ICISC 2006","DOI":"10.1093\/ietfec\/e91-a.1.39"},{"issue":"13\u201314","key":"7_CR31","first-page":"1089","volume":"14","author":"H Yuen","year":"2014","unstructured":"Yuen, H.: A quantum lower bound for distinguishing random functions from random permutations. Quant. Inf. Comput. 14(13\u201314), 1089\u20131097 (2014). https:\/\/arxiv.org\/abs\/1310.2885","journal-title":"Quant. Inf. Comput."},{"issue":"7\u20138","key":"7_CR32","first-page":"557","volume":"15","author":"M Zhandry","year":"2015","unstructured":"Zhandry, M.: A note on the quantum collision and set equality problems. Quantum Inf. Comput. 15(7\u20138), 557\u2013567 (2015)","journal-title":"Quantum Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2017"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-70697-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:27:30Z","timestamp":1710343650000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-70697-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319706962","9783319706979"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-70697-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"18 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/asiacrypt.iacr.org\/2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}