{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:18:15Z","timestamp":1766269095513,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031229114"},{"type":"electronic","value":"9783031229121"}],"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-22912-1_29","type":"book-chapter","created":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T15:38:49Z","timestamp":1672501129000},"page":"658-678","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Two Remarks on\u00a0the\u00a0Vectorization Problem"],"prefix":"10.1007","author":[{"given":"Wouter","family":"Castryck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natan","family":"Vander Meeren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-030-64834-3_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"N Alamati","year":"2020","unstructured":"Alamati, N., De Feo, L., Montgomery, H., Patranabis, S.: Cryptographic group actions and applications. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 411\u2013439. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_14"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Alman, J., Williams, V.V.: A refined laser method and faster matrix multiplication. In: SODA 2020, pp. 522\u2013539. SIAM (2021)","DOI":"10.1137\/1.9781611976465.32"},{"key":"29_CR3","unstructured":"Assmus, E.F., Key, J.D.: Polynomial codes and finite geometries. In: Handbook of Coding Theory, vol. I, II, pp. 1269\u20131343 (1998)"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time [extended abstract]. In: STOC\u201916, pp. 684\u2013697. ACM, New York (2016)","DOI":"10.1145\/2897518.2897542"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/978-3-030-03326-2_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"X Bonnetain","year":"2018","unstructured":"Bonnetain, X., Naya-Plasencia, M.: Hidden shift quantum cryptanalysis and implications. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 560\u2013592. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_19"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Brassard, G., Cr\u00e9peau, C.: Non-transitive transfer of confidence: a perfect zero-knowledge interactive protocol for SAT and beyond. In: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pp. 188\u2013195 (1986)","DOI":"10.1109\/SFCS.1986.33"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BFb0035756","volume-title":"Automata, Languages and Programming","author":"G Brassard","year":"1989","unstructured":"Brassard, G., Cr\u00e9peau, C., Yung, M.: Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 123\u2013136. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0035756"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-38424-3_7","volume-title":"Advances in Cryptology-CRYPT0\u2019 90","author":"G Brassard","year":"1991","unstructured":"Brassard, G., Yung, M.: One-way group actions. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 94\u2013107. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-38424-3_7"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-030-81293-5_8","volume-title":"Post-Quantum Cryptography","author":"W Castryck","year":"2021","unstructured":"Castryck, W., Dooms, A., Emerencia, C., Lemmens, A.: A fusion algorithm for solving the hidden shift problem in finite abelian groups. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 133\u2013153. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_8"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-03332-3_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"W Castryck","year":"2018","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 395\u2013427. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_15"},{"key":"29_CR11","unstructured":"Chenu, M., de La Morinerie: Supersingular group actions and post-quantum key exchange. PhD thesis, Institut Polytechnique de Paris (2021)"},{"issue":"1","key":"29_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/jmc-2012-0016","volume":"8","author":"AM Childs","year":"2014","unstructured":"Childs, A.M., Jao, D., Soukharev, V.: Constructing elliptic curve isogenies in quantum subexponential time. J. Math. Crypt. 8(1), 1\u201329 (2014)","journal-title":"J. Math. Crypt."},{"key":"29_CR13","unstructured":"Couveignes, J.-M.: Hard homogeneous spaces (1997). IACR Cryptology ePrint Archive, Report 2006\/291. https:\/\/ia.cr\/2006\/291"},{"issue":"1","key":"29_CR14","doi-asserted-by":"publisher","first-page":"339","DOI":"10.4007\/annals.2017.185.1.8","volume":"185","author":"JS Ellenberg","year":"2017","unstructured":"Ellenberg, J.S., Gijswijt, D.: On large subsets of $$\\mathbb{F} _q^n$$ with no three-term arithmetic progression. Ann. Math. 185(1), 339\u2013343 (2017)","journal-title":"Ann. Math."},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Friedl, K., Ivanyos, G., Magniez, F., Santha, M., Sen, P.: Hidden translation and Orbit Coset in quantum computing. In: STOC\u201903, pp. 1\u20139. ACM, New York (2003)","DOI":"10.1145\/780542.780544"},{"issue":"1","key":"29_CR16","first-page":"40","volume":"1","author":"S Galbraith","year":"2021","unstructured":"Galbraith, S., Panny, L., Smith, B., Vercauteren, F.: Quantum equivalence of the DLP and CDHP for group actions. Math. Crypt. 1(1), 40\u201344 (2021)","journal-title":"Math. Crypt."},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Gnilke, O.W., Zumbr\u00e4gel, J.: Cryptographic group and semigroup actions. In: WCC 2022, Designs, Codes and Cryptography. Springer (2022)","DOI":"10.1142\/S0219498825300016"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: STOC\u201996, pp. 212\u2013219. ACM (1996)","DOI":"10.1145\/237814.237866"},{"key":"29_CR19","unstructured":"Hallgren, S.: Quantum Fourier sampling, the hidden subgroup problem, and beyond. PhD thesis, University of California, Berkeley (2000)"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Helfgott, H.A.: Isomorphismes de graphes en temps quasi-polynomial [d\u2019apr\u00e8s Babai et Luks, Weisfeiler-Leman,...]. Ast\u00e9risque, (407), pp.135\u2013182 (2019). S\u00e9minaire Bourbaki (exp. no. 1125)","DOI":"10.24033\/ast.1063"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Iliashenko, I., Zucca, V.: Faster homomorphic comparison operations for BGV and BFV. In: PETS 2021 (3), pp. 246\u2013264. De Gruyter (2021)","DOI":"10.2478\/popets-2021-0046"},{"issue":"6\u20137","key":"29_CR22","first-page":"579","volume":"8","author":"G Ivanyos","year":"2008","unstructured":"Ivanyos, G.: On solving systems of random linear disequations. Quantum Inf. Comput. 8(6\u20137), 579\u2013594 (2008)","journal-title":"Quantum Inf. Comput."},{"key":"29_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-030-36030-6_11","volume-title":"Theory of Cryptography","author":"Z Ji","year":"2019","unstructured":"Ji, Z., Qiao, Y., Song, F., Yun, A.: General linear group action on tensors: a candidate for post-quantum cryptography. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 251\u2013281. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_11"},{"issue":"1","key":"29_CR24","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/S0097539703436345","volume":"35","author":"G Kuperberg","year":"2005","unstructured":"Kuperberg, G.: A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM J. Comput. 35(1), 170\u2013188 (2005)","journal-title":"SIAM J. Comput."},{"key":"29_CR25","unstructured":"Kuperberg, G.: Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem. In: TQC 2013, volume 22 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 20\u201334 (2013)"},{"issue":"5","key":"29_CR26","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.1137\/S0097539796302749","volume":"28","author":"U Maurer","year":"1999","unstructured":"Maurer, U., Wolf, S.: The relationship between breaking the Diffie-Hellman protocol and computing discrete logarithms. SIAM J. Comput. 28(5), 1689\u20131721 (1999)","journal-title":"SIAM J. Comput."},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"Montgomery, H., Zhandry, M.: Full quantum equivalence of group action DLog and CDH, and more. In: Asiacrypt, Lecture Notes in Computer Science. Springer (2022)","DOI":"10.1007\/978-3-031-22963-3_1"},{"key":"29_CR28","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"29_CR29","doi-asserted-by":"crossref","unstructured":"Peikert, C.: He gives C-sieves on the CSIDH. In: Eurocrypt 2, volume 12106 of Lecture Notes in Computer Science, pp. 463\u2013492 (2020)","DOI":"10.1007\/978-3-030-45724-2_16"},{"key":"29_CR30","unstructured":"Regev, O.: A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space (2004). Cornell University arXiv https:\/\/arxiv.org\/abs\/quant-ph\/0406151"},{"key":"29_CR31","unstructured":"Rostovtsev, A., Stolbunov, A.: Public-key cryptosystem based on isogenies (2006). IACR Cryptology ePrint Archive, Report 2006\/145. https:\/\/ia.cr\/2006\/145\/"},{"key":"29_CR32","doi-asserted-by":"crossref","unstructured":"Jean-Pierre Serre. Local fields, volume 67 of Graduate Texts in Mathematics. Springer-Verlag, 1979. Translated from the French by Marvin Jay Greenberg","DOI":"10.1007\/978-1-4757-5673-9"},{"issue":"5","key":"29_CR33","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"29_CR34","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)","journal-title":"SIAM J. Comput."},{"key":"29_CR35","doi-asserted-by":"crossref","unstructured":"Smith, B.: Pre- and post-quantum Diffie-Hellman from groups, actions, and isogenies. In: WAIFI 2018, volume 11321 of Lecture Notes in Computer Science, pp. 3\u201340 (2018)","DOI":"10.1007\/978-3-030-05153-2_1"},{"key":"29_CR36","unstructured":"Stolbunov, A.: Cryptographic schemes based on isogenies. PhD thesis, Norwegian University of Science and Technology (2012)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22912-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,3]],"date-time":"2023-12-03T20:24:31Z","timestamp":1701635071000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22912-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229114","9783031229121"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22912-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"11 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2022","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":"indocrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.tcgcrest.org\/indocrypt-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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"74","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":"31","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":"42% - 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.22","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":"4.59","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)"}}]}}