{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T11:22:37Z","timestamp":1762341757756,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030882372"},{"type":"electronic","value":"9783030882389"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-88238-9_1","type":"book-chapter","created":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T08:17:47Z","timestamp":1632903467000},"page":"3-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Tight Bounds for Simon\u2019s Algorithm"],"prefix":"10.1007","author":[{"given":"Xavier","family":"Bonnetain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,30]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-319-72565-9_20","volume-title":"Selected Areas in Cryptography","author":"X Bonnetain","year":"2018","unstructured":"Bonnetain, X.: Quantum key-recovery on full AEZ. In: Adams, C., Camenisch, J. (eds.) SAC 2017. LNCS, vol. 10719, pp. 394\u2013406. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72565-9_20"},{"key":"1_CR2","unstructured":"Bonnetain, X.: Collisions on Feistel-MiMC and univariate GMiMC. Cryptology ePrint Archive, Report 2019\/951 (2019). https:\/\/eprint.iacr.org\/2019\/951"},{"key":"1_CR3","unstructured":"Bonnetain, X.: Tight bounds for Simon\u2019s algorithm. IACR Cryptol. ePrint Arch. 2020, 919 (2020). https:\/\/eprint.iacr.org\/2020\/919"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bonnetain, X., Hosoyamada, A., Naya-Plasencia, M., Sasaki, Y., Schrottenloher, A.: Quantum attacks without superposition queries: the offline Simon\u2019s algorithm. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019, Part I. LNCS, vol. 11921, pp. 552\u2013583. Springer, December 2019","DOI":"10.1007\/978-3-030-34578-5_20"},{"key":"1_CR5","unstructured":"Bonnetain, X., Jaques, S.: Quantum period finding against symmetric primitives in practice. CoRR abs\/2011.07022 (2020), https:\/\/arxiv.org\/abs\/2011.07022"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Bonnetain, X., Naya-Plasencia, M., Schrottenloher, A.: On quantum slide attacks. In: Paterson, K.G., Stebila, D. (eds.) SAC 2019. LNCS, vol. 11959, pp. 492\u2013519. Springer, August 2019","DOI":"10.1007\/978-3-030-38471-5_20"},{"key":"1_CR7","unstructured":"Brassard, G., Hoyer, P.: An exact quantum polynomial-time algorithm for Simon\u2019s problem. In: Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, pp. 12\u201323 (1997)"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. In: Lomo-naco, S.J., Brandt, H.E. (eds.) Quantum Computation and Information, AMS Contemporary Mathematics, vol. 305 (2002)","DOI":"10.1090\/conm\/305\/05215"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-030-65277-7_17","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2020","author":"C Cid","year":"2020","unstructured":"Cid, C., Hosoyamada, A., Liu, Y., Sim, S.M.: Quantum cryptanalysis on contracting feistel structures and observation on related-key settings. In: Bhargavan, K., Oswald, E., Prabhakaran, M. (eds.) INDOCRYPT 2020. LNCS, vol. 12578, pp. 373\u2013394. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65277-7_17"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Dong, X., Dong, B., Wang, X.: Quantum attacks on some Feistel block ciphers. Des. Codes Cryptogr. 88(6), 1179\u20131203 (2020)","DOI":"10.1007\/s10623-020-00741-y"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Dong, X., Li, Z., Wang, X.: Quantum cryptanalysis on some generalized Feistel schemes. Sci. China Inf. Sci. 62(2), 22501:1\u201322501:12 (2019)","DOI":"10.1007\/s11432-017-9436-7"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Dong, X., Wang, X.: Quantum key-recovery attack on feistel structures. Sci. China Inf. Sci. 61(10), 102501:1\u2013102501:7 (2018)","DOI":"10.1007\/s11432-017-9468-y"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-030-44223-1_25","volume-title":"Post-Quantum Cryptography","author":"S Hod\u017ei\u0107","year":"2020","unstructured":"Hod\u017ei\u0107, S., Knudsen Ramkilde, L., Brasen Kidmose, A.: On quantum distinguishers for Type-3 generalized Feistel network based on separability. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 461\u2013480. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_25"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Hod\u017ei\u0107, S., Knudsen, L.: A quantum distinguisher for 7\/8-round sms4 block cipher. Quant. Inf. Process. 19, 411 (2020)","DOI":"10.1007\/s11128-020-02929-6"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-64200-0_1","volume-title":"Advances in Information and Computer Security","author":"A Hosoyamada","year":"2017","unstructured":"Hosoyamada, A., Aoki, K.: On quantum related-key attacks on iterated even-mansour ciphers. In: Obana, S., Chida, K. (eds.) IWSEC 2017. LNCS, vol. 10418, pp. 3\u201318. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-64200-0_1"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Hosoyamada, A., Sasaki, Y.: Cryptanalysis against symmetric-key schemes with online classical queries and offline quantum computations. In: Smart, N.P. (ed.) CT-RSA 2018. LNCS, vol. 10808, pp. 198\u2013218. Springer, Cham, April 2018","DOI":"10.1007\/978-3-319-76953-0_11"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-030-12612-4_20","volume-title":"Topics in Cryptology \u2013 CT-RSA 2019","author":"G Ito","year":"2019","unstructured":"Ito, G., Hosoyamada, A., Matsumoto, R., Sasaki, Yu., Iwata, T.: Quantum chosen-ciphertext attacks against feistel ciphers. In: Matsui, M. (ed.) CT-RSA 2019. LNCS, vol. 11405, pp. 391\u2013411. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_20"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Kaplan, M., Leurent, G., Leverrier, A., Naya-Plasencia, M.: Breaking symmetric cryptosystems using quantum period finding. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part II. LNCS, vol. 9815, pp. 207\u2013237. Springer, August 2016","DOI":"10.1007\/978-3-662-53008-5_8"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Koiran, P., Nesme, V., Portier, N.: The quantum query complexity of the abelian hidden subgroup problem. Theor. Comput. Sci. 380(1\u20132), 115\u2013126 (2007)","DOI":"10.1016\/j.tcs.2007.02.057"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Kuwakado, H., Morii, M.: Quantum distinguisher between the 3-round feistel cipher and the random permutation. In: IEEE Proceedings of the International Symposium on Information Theory (ISIT 2010), June 13\u201318, 2010, pp. 2682\u20132685. Austin (2010)","DOI":"10.1109\/ISIT.2010.5513654"},{"key":"1_CR21","unstructured":"Kuwakado, H., Morii, M.: Security on the quantum-type even-mansour cipher. In: Proceedings of ISITA 2012, . October 28\u201331, pp. 312\u2013316. Honolulu, HI (2012)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Leander, G., May, A.: Grover meets Simon - quantumly attacking the FX-construction. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017, Part II. LNCS, vol. 10625, pp. 161\u2013178. Springer, December 2017","DOI":"10.1007\/978-3-319-70697-9_6"},{"key":"1_CR23","unstructured":"May, A., Schlieper, L.: Quantum period finding with a single output qubit - factoring n-bit RSA with n\/2 qubits. CoRR abs\/1905.10074 (2019)"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Ni, B., Ito, G., Dong, X., Iwata, T.: Quantum attacks against type-1 generalized Feistel ciphers and applications to CAST-256. In: Hao, F., Ruj, S., Sen Gupta, S. (eds.) INDOCRYPT 2019. LNCS, vol. 11898, pp. 433\u2013455. Springer, December 2019","DOI":"10.1007\/978-3-030-35423-7_22"},{"key":"1_CR25","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information, 10th Anniversary edn. Cambridge University Press, Cambridge (2016)"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Rahman, M., Paul, G.: Quantum attacks on HCTR and its variants. IACR Cryptol. ePrint Arch. 2020, 802 (2020)","DOI":"10.1109\/TQE.2020.3041426"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Roetteler, M., Steinwandt, R.: A note on quantum related-key attacks. Inf. Process. Lett. 115(1), 40\u201344 (2015)","DOI":"10.1016\/j.ipl.2014.08.009"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Santoli, T., Schaffner, C.: Using Simon\u2019s algorithm to attack symmetric-key cryptographic primitives. Quant. Inf. Comput. 17(1 & 2), 65\u201378 (2017)","DOI":"10.26421\/QIC17.1-2-4"},{"key":"1_CR29","unstructured":"Shor, P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: 35th FOCS, pp. 124\u2013134. IEEE Computer Society Press, November 1994"},{"key":"1_CR30","unstructured":"Simon, D.R.: On the power of quantum computation. In: 35th FOCS, pp. 116\u2013123. IEEE Computer Society Press, November 1994"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Zalka, C.: Grover\u2019s quantum searching algorithm is optimal. Phys. Rev. A 60(4), 2746 (1999)","DOI":"10.1103\/PhysRevA.60.2746"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88238-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:57:00Z","timestamp":1710269820000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88238-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030882372","9783030882389"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88238-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATINCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Information Security in Latin America","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bogot\u00e1","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colombia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latincrypt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/urosario.edu.co\/Latin-Crypt\/inicio\/","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":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","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":"22","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","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":"5","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":"The conference took place virtually due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}