{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:01:13Z","timestamp":1786978873506,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031229688","type":"print"},{"value":"9783031229695","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22969-5_20","type":"book-chapter","created":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T11:48:42Z","timestamp":1674560922000},"page":"583-613","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Nostradamus Goes Quantum"],"prefix":"10.1007","author":[{"given":"Barbara Jiabao","family":"Benedikt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0597-8297","authenticated-orcid":false,"given":"Marc","family":"Fischlin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moritz","family":"Huppert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Amy, M., Matteo, O.D., Gheorghiu, V., Mosca, M., Parent, A., Schanck, J.M.: Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3. In: Avanzi, R., Heys, H.M. (eds.) Selected Areas in Cryptography - SAC 2016\u201323rd International Conference, St. John\u2019s, NL, Canada, 10\u201312 August 2016, Revised Selected Papers. Lecture Notes in Computer Science, vol. 10532, pp. 317\u2013337. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-69453-5_18","DOI":"10.1007\/978-3-319-69453-5_18"},{"key":"20_CR2","doi-asserted-by":"publisher","unstructured":"Andreeva, E., Bouillaguet, C., Dunkelman, O., Kelsey, J.: Herding, second preimage and trojan message attacks beyond Merkle-damg\u00e5rd. In: Jr., M.J.J., Rijmen, V., Safavi-Naini, R. (eds.) Selected Areas in Cryptography, 16th Annual International Workshop, SAC 2009, Calgary, Alberta, Canada, 13\u201314 August 2009, Revised Selected Papers. Lecture Notes in Computer Science, vol. 5867, pp. 393\u2013414. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-05445-7_25","DOI":"10.1007\/978-3-642-05445-7_25"},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Andreeva, E., Mennink, B.: Provable chosen-target-forced-midfix preimage resistance. In: Miri, A., Vaudenay, S. (eds.) Selected Areas in Cryptography - 18th International Workshop, SAC 2011, Toronto, ON, Canada, 11\u201312 August 2011, Revised Selected Papers. Lecture Notes in Computer Science, vol. 7118, pp. 37\u201354. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-28496-0_3","DOI":"10.1007\/978-3-642-28496-0_3"},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Banegas, G., Bernstein, D.J.: Low-communication parallel quantum multi-target preimage search. In: Adams, C., Camenisch, J. (eds.) Selected Areas in Cryptography - SAC 2017\u201324th International Conference, Ottawa, ON, Canada, 16\u201318 August 2017, Revised Selected Papers. Lecture Notes in Computer Science, vol. 10719, pp. 325\u2013335. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-72565-9_16","DOI":"10.1007\/978-3-319-72565-9_16"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Bellare, M., Kohno, T.: Hash function balance and its impact on birthday attacks. In: Cachin, C., Camenisch, J. (eds.) Advances in Cryptology - EUROCRYPT 2004. Lecture Notes in Computer Science, vol. 3027, pp. 401\u2013418. Springer, Heidelberg, Germany, Interlaken, Switzerland, 2\u20136 May 2004. https:\/\/doi.org\/10.1007\/978-3-540-24676-3_24","DOI":"10.1007\/978-3-540-24676-3_24"},{"key":"20_CR6","unstructured":"Bernstein, D.: ChaCha, a variant of Salsa20 (2008). https:\/\/cr.yp.to\/chacha\/chacha-20080128.pdf"},{"key":"20_CR7","unstructured":"Bernstein, D.J.: Cost analysis of hash collisions : will quantum computers make SHARCS obsolete? In: SHARCS 2009 Workshop Record (Proceedings 4th Workshop on Special-purpose Hardware for Attacking Cryptograhic Systems, Lausanne, Switserland, 9\u201310 September 2009), pp. 105\u2013116 (2009)"},{"key":"20_CR8","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sponge functions. Ecrypt Hash Workshop (2007)"},{"issue":"1\u20132","key":"20_CR9","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10623-010-9481-x","volume":"64","author":"SR Blackburn","year":"2012","unstructured":"Blackburn, S.R., Stinson, D.R., Upadhyay, J.: On the complexity of the herding attack and some related attacks on hash functions. Des. Codes Cryptogr. 64(1\u20132), 171\u2013193 (2012)","journal-title":"Des. Codes Cryptogr."},{"key":"20_CR10","doi-asserted-by":"publisher","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.) Advances in Cryptology - ASIACRYPT 2011\u201317th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, 4\u20138 December 2011. Proceedings. Lecture Notes in Computer Science, vol. 7073, pp. 41\u201369. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3","DOI":"10.1007\/978-3-642-25385-0_3"},{"issue":"1","key":"20_CR11","first-page":"1","volume":"2022","author":"X Bonnetain","year":"2022","unstructured":"Bonnetain, X., Jaques, S.: Quantum period finding against symmetric primitives in practice. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(1), 1\u201327 (2022)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"issue":"4\u20135","key":"20_CR12","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. Fortschritte der Physik 46(4\u20135), 493\u2013505 (1998)","journal-title":"Fortschritte der Physik"},{"key":"20_CR13","doi-asserted-by":"publisher","unstructured":"Brassard, G., H\u00f8yer, P., Tapp, A.: Quantum cryptanalysis of hash and claw-free functions. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998: Theoretical Informatics, Third Latin American Symposium, Campinas, Brazil, 20\u201324 April 1998, Proceedings. Lecture Notes in Computer Science, vol. 1380, pp. 163\u2013169. Springer (1998). https:\/\/doi.org\/10.1007\/BFb0054319","DOI":"10.1007\/BFb0054319"},{"key":"20_CR14","doi-asserted-by":"publisher","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.) Advances in Cryptology - ASIACRYPT 2017\u201323rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, 3\u20137 December 2017, Proceedings, Part II. Lecture Notes in Computer Science, vol. 10625, pp. 211\u2013240. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_8","DOI":"10.1007\/978-3-319-70697-9_8"},{"key":"20_CR15","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I.: A design principle for hash functions. In: Brassard, G. (ed.) Advances in Cryptology - CRYPTO\u201989. Lecture Notes in Computer Science, vol. 435, pp. 416\u2013427. Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 20\u201324 August 1990. https:\/\/doi.org\/10.1007\/0-387-34805-0_39","DOI":"10.1007\/0-387-34805-0_39"},{"key":"20_CR16","unstructured":"Dang, Q.: Secure hash standard. Federal Inf. Process. Stds. (NIST FIPS), National Institute of Standards and Technology, Gaithersburg, MD (2015\u201308-04 2015)"},{"key":"20_CR17","unstructured":"Dean, R.D.: Formal Aspects of Mobile Code Security. Ph.D. thesis, Computer Science Department, Princeton University (1999)"},{"key":"20_CR18","doi-asserted-by":"publisher","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.) Advances in Cryptology - ASIACRYPT 2020, Part II. Lecture Notes in Computer Science, vol. 12492, pp. 727\u2013757. Springer, Heidelberg, Germany, Daejeon, South Korea, 7\u201311 December 2020. https:\/\/doi.org\/10.1007\/978-3-030-64834-3_25","DOI":"10.1007\/978-3-030-64834-3_25"},{"key":"20_CR19","doi-asserted-by":"publisher","unstructured":"Dong, X., Zhang, Z., Sun, S., Wei, C., Wang, X., Hu, L.: Automatic classical and quantum rebound attacks on aes-like hashing by exploiting related-key differentials. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology - ASIACRYPT 2021\u201327th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, 6\u201310 December 2021, Proceedings, Part I. Lecture Notes in Computer Science, vol. 13090, pp. 241\u2013271. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_9","DOI":"10.1007\/978-3-030-92062-3_9"},{"key":"20_CR20","unstructured":"Dworkin, M.: SHA-3 standard: permutation-based hash and extendable-output functions. Federal Inf. Process. Stds. (NIST FIPS), National Institute of Standards and Technology, Gaithersburg, MD (2015\u201308-04 2015)"},{"key":"20_CR21","unstructured":"Efthymiou, S., et al.: Qibo: An open-source full stack API for quantum simulation and quantum hardware control (2022). https:\/\/github.com\/qiboteam\/qibo"},{"key":"20_CR22","doi-asserted-by":"publisher","unstructured":"Fl\u00f3rez-Guti\u00e9rrez, A., Leurent, G., Naya-Plasencia, M., Perrin, L., Schrottenloher, A., Sibleyras, F.: New results on Gimli: full-permutation distinguishers and improved collisions. In: Moriai, S., Wang, H. (eds.) Advances in Cryptology - ASIACRYPT 2020, Part I. Lecture Notes in Computer Science, vol. 12491, pp. 33\u201363. Springer, Heidelberg, Germany, Daejeon, South Korea, 7\u201311 December 2020. https:\/\/doi.org\/10.1007\/978-3-030-64837-4_2","DOI":"10.1007\/978-3-030-64837-4_2"},{"key":"20_CR23","doi-asserted-by":"crossref","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)","DOI":"10.1145\/237814.237866"},{"key":"20_CR24","doi-asserted-by":"publisher","unstructured":"Hosoyamada, A., Sasaki, Y.: Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound. In: Canteaut, A., Ishai, Y. (eds.) Advances in Cryptology - EUROCRYPT 2020, Part II. Lecture Notes in Computer Science, vol. 12106, pp. 249\u2013279. Springer, Heidelberg, Germany, Zagreb, Croatia, 10\u201314 May 2020. https:\/\/doi.org\/10.1007\/978-3-030-45724-2_9","DOI":"10.1007\/978-3-030-45724-2_9"},{"key":"20_CR25","doi-asserted-by":"publisher","unstructured":"Hosoyamada, A., Sasaki, Y.: Quantum collision attacks on reduced SHA-256 and SHA-512. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology - CRYPTO 2021, Part I. Lecture Notes in Computer Science, vol. 12825, pp. 616\u2013646. Springer, Heidelberg, Germany, Virtual Event, 16\u201320 August 2021. https:\/\/doi.org\/10.1007\/978-3-030-84242-0_22","DOI":"10.1007\/978-3-030-84242-0_22"},{"key":"20_CR26","doi-asserted-by":"publisher","unstructured":"Kelsey, J., Kohno, T.: Herding hash functions and the nostradamus attack. In: Vaudenay, S. (ed.) Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, 28 May\u20131 June 2006, Proceedings. Lecture Notes in Computer Science, vol. 4004, pp. 183\u2013200. Springer (2006). https:\/\/doi.org\/10.1007\/11761679_12","DOI":"10.1007\/11761679_12"},{"key":"20_CR27","doi-asserted-by":"publisher","unstructured":"Kelsey, J., Schneier, B.: Second preimages on n-bit hash functions for much less than 2$${}^{\\text{n}}$$ work. In: Cramer, R. (ed.) Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, 22\u201326 May 2005, Proceedings. Lecture Notes in Computer Science, vol. 3494, pp. 474\u2013490. Springer (2005). https:\/\/doi.org\/10.1007\/11426639_28","DOI":"10.1007\/11426639_28"},{"key":"20_CR28","doi-asserted-by":"publisher","unstructured":"Kortelainen, T., Kortelainen, J.: On diamond structures and trojan message attacks. In: Sako, K., Sarkar, P. (eds.) Advances in Cryptology - ASIACRYPT 2013\u201319th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, 1\u20135 December 2013, Proceedings, Part II. Lecture Notes in Computer Science, vol. 8270, pp. 524\u2013539. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_27","DOI":"10.1007\/978-3-642-42045-0_27"},{"key":"20_CR29","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. LNCS, vol. 11478, pp. 189\u2013218. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_7"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) Advances in Cryptology - CRYPTO\u201989. Lecture Notes in Computer Science, vol. 435, pp. 218\u2013238. Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 20\u201324 August 1990","DOI":"10.1007\/0-387-34805-0_21"},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Ni, B., Dong, X., Jia, K., You, Q.: (quantum) collision attacks on reduced simpira v2. IACR Trans. Symmetric Cryptol. 2021(2), 222\u2013248 (2021)","DOI":"10.46586\/tosc.v2021.i2.222-248"},{"issue":"3","key":"20_CR32","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D Pointcheval","year":"2000","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. Cryptol. 13(3), 361\u2013396 (2000)","journal-title":"J. Cryptol."},{"issue":"5","key":"20_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-021-03118-9","volume":"20","author":"S Ramos-Calderer","year":"2021","unstructured":"Ramos-Calderer, S., Bellini, E., Latorre, J.I., Manzano, M., Mateu, V.: Quantum search for scaled hash function preimages. Quantum Inf. Process. 20(5), 1\u201328 (2021). https:\/\/doi.org\/10.1007\/s11128-021-03118-9","journal-title":"Quantum Inf. Process."},{"key":"20_CR34","unstructured":"Wang, R., Li, X., Gao, J., Li, H., Wang, B.: Quantum rotational cryptanalysis for preimage recovery of round-reduced keccak. IACR Cryptol. ePrint Arch, p. 13 (2022). https:\/\/eprint.iacr.org\/2022\/013"},{"key":"20_CR35","doi-asserted-by":"publisher","unstructured":"Weizman, A., Dunkelman, O., Haber, S.: Efficient construction of diamond structures. In: Patra, A., Smart, N.P. (eds.) Progress in Cryptology - INDOCRYPT 2017\u201318th International Conference on Cryptology in India, Chennai, India, 10\u201313 December 2017, Proceedings. Lecture Notes in Computer Science, vol. 10698, pp. 166\u2013185. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-71667-1_9","DOI":"10.1007\/978-3-319-71667-1_9"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22969-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:02:57Z","timestamp":1769216577000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22969-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229688","9783031229695"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22969-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 January 2023","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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2022\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"364","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":"98","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":"27% - 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","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":"10","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}