{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T21:34:51Z","timestamp":1772487291139,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031159817","type":"print"},{"value":"9783031159824","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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15982-4_26","type":"book-chapter","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T04:40:54Z","timestamp":1665463254000},"page":"779-808","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Simon\u2019s Algorithm and Symmetric Crypto: Generalizations\u00a0and\u00a0Automatized\u00a0Applications"],"prefix":"10.1007","author":[{"given":"Federico","family":"Canale","sequence":"first","affiliation":[]},{"given":"Gregor","family":"Leander","sequence":"additional","affiliation":[]},{"given":"Lukas","family":"Stennes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"issue":"5","key":"26_CR1","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E Bernstein","year":"1997","unstructured":"Bernstein, E., Vazirani, U.V.: Quantum complexity theory. SIAM J. Comput. 26(5), 1411\u20131473 (1997)","journal-title":"SIAM J. Comput."},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-030-34578-5_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"X Bonnetain","year":"2019","unstructured":"Bonnetain, X., Hosoyamada, A., Naya-Plasencia, M., Sasaki, Yu., Schrottenloher, A.: Quantum attacks without superposition queries: the offline Simon\u2019s algorithm. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 552\u2013583. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_20"},{"key":"26_CR3","first-page":"1418","volume":"2020","author":"X Bonnetain","year":"2020","unstructured":"Bonnetain, X., Jaques, S.: Quantum period finding against symmetric primitives in practice. IACR Cryptol. ePrint Arch. 2020, 1418 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-030-92062-3_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"X Bonnetain","year":"2021","unstructured":"Bonnetain, X., Leurent, G., Naya-Plasencia, M., Schrottenloher, A.: Quantum linearization attacks. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, Part I. LNCS, vol. 13090, pp. 422\u2013452. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_15"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Canale, F., Leander, G., Stennes, L.: Simon\u2019s algorithm and symmetric crypto: Generalizations and automatized applications. Cryptology ePrint Archive, Paper 2022\/782 (2022), https:\/\/eprint.iacr.org\/2022\/782","DOI":"10.1007\/978-3-031-15982-4_26"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Boolean Functions for Cryptography and Coding Theory. Cambridge University Press, Cambridge (2021)","DOI":"10.1017\/9781108606806"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-030-26948-7_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"YL Chen","year":"2019","unstructured":"Chen, Y.L., Lambooij, E., Mennink, B.: How to build pseudorandom functions from public random permutations. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part I. LNCS, vol. 11692, pp. 266\u2013293. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_10"},{"issue":"3","key":"26_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s11128-021-03027-x","volume":"20","author":"J Cui","year":"2021","unstructured":"Cui, J., Guo, J., Ding, S.: Applications of Simon\u2019s algorithm in quantum attacks on Feistel variants. Quantum Inf. Process. 20(3), 117 (2021)","journal-title":"Quantum Inf. Process."},{"key":"26_CR9","volume-title":"On the Automorphisms of the Classical Groups","author":"J Dieudonn\u00e9","year":"1951","unstructured":"Dieudonn\u00e9, J., Hua, L.: On the Automorphisms of the Classical Groups. Memoirs of the American Mathematical Society, American Mathematical Society (1951)"},{"issue":"2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.46586\/tosc.v2021.i2.31-70","volume":"2021","author":"A Dutta","year":"2021","unstructured":"Dutta, A., Nandi, M., Talnikar, S.: Permutation based EDM: an inverse free BBB secure PRF. IACR Trans. Symmetric Cryptol. 2021(2), 31\u201370 (2021)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-030-68890-5_3","volume-title":"Information Security and Cryptology \u2013 ICISC 2020","author":"A Gouget","year":"2021","unstructured":"Gouget, A., Patarin, J., Toulemonde, A.: (Quantum) cryptanalysis of Misty schemes. In: Hong, D. (ed.) ICISC 2020. LNCS, vol. 12593, pp. 43\u201357. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68890-5_3"},{"key":"26_CR12","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, pp. 212\u2013219. ACM (1996)","DOI":"10.1145\/237814.237866"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-030-81293-5_22","volume-title":"Post-Quantum Cryptography","author":"T Guo","year":"2021","unstructured":"Guo, T., Wang, P., Hu, L., Ye, D.: Attacks on beyond-birthday-bound MACs in the quantum setting. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 421\u2013441. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_22"},{"key":"26_CR14","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, Y., 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":"26_CR15","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 I. LNCS, vol. 9815, pp. 207\u2013237. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_8"},{"issue":"6","key":"26_CR16","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1002\/jcd.20043","volume":"13","author":"H Kharaghani","year":"2005","unstructured":"Kharaghani, H., Tayfeh-Rezaie, B.: A Hadamard matrix of order 428. J. Comb. Des. 13(6), 435\u2013440 (2005)","journal-title":"J. Comb. Des."},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Kuwakado, H., Morii, M.: Quantum distinguisher between the 3-round Feistel cipher and the random permutation. In: IEEE International Symposium on Information Theory, ISIT 2010, Proceedings, pp. 2682\u20132685. IEEE (2010)","DOI":"10.1109\/ISIT.2010.5513654"},{"key":"26_CR18","unstructured":"Kuwakado, H., Morii, M.: Security on the quantum-type Even-Mansour cipher. In: Proceedings of the International Symposium on Information Theory and its Applications, ISITA 2012, pp. 312\u2013316. IEEE (2012)"},{"issue":"3","key":"26_CR19","doi-asserted-by":"publisher","first-page":"519","DOI":"10.2307\/1970063","volume":"65","author":"J Landin","year":"1957","unstructured":"Landin, J., Reiner, I.: Automorphisms of the general linear group over a principal ideal domain. Ann. Math. 65(3), 519\u2013526 (1957)","journal-title":"Ann. Math."},{"key":"26_CR20","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":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-60865-6_54","volume-title":"Fast Software Encryption","author":"M Matsui","year":"1996","unstructured":"Matsui, M.: New structure of block ciphers with provable security against differential and linear cryptanalysis. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 205\u2013218. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60865-6_54"},{"key":"26_CR22","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":"26_CR23","unstructured":"May, A., Schlieper, L., Schwinger, J.: Practical period finding on IBM Q - quantum speedups in the presence of errors. CoRR abs\/1910.00802 (2019)"},{"key":"26_CR24","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information (10th Anniversary edition). Cambridge University Press (2016)"},{"key":"26_CR25","first-page":"802","volume":"2020","author":"M Rahman","year":"2020","unstructured":"Rahman, M., Paul, G.: Quantum attacks on HCTR and its variants. IACR Cryptol. ePrint Arch. 2020, 802 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"1 &2","key":"26_CR26","first-page":"65","volume":"17","author":"T Santoli","year":"2017","unstructured":"Santoli, T., Schaffner, C.: Using Simon\u2019s algorithm to attack symmetric-key cryptographic primitives. Quantum Inf. Comput. 17(1 &2), 65\u201378 (2017)","journal-title":"Quantum Inf. Comput."},{"key":"26_CR27","unstructured":"Xie, H., Yang, L.: Using Bernstein-Vazirani algorithm to attack block ciphers. CoRR abs\/1711.00853 (2017)"},{"issue":"5","key":"26_CR28","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1007\/s10623-018-0510-5","volume":"87","author":"H Xie","year":"2019","unstructured":"Xie, H., Yang, L.: Using Bernstein-Vazirani algorithm to attack block ciphers. Des. Codes Cryptogr. 87(5), 1161\u20131182 (2019)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15982-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:06:19Z","timestamp":1760133979000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15982-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159817","9783031159824"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15982-4_26","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":"12 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}