{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T03:55:11Z","timestamp":1780545311388,"version":"3.54.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031918254","type":"print"},{"value":"9783031918261","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-91826-1_12","type":"book-chapter","created":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T04:28:59Z","timestamp":1746592139000},"page":"364-387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multiple Group Action Dlogs With(out) Precomputation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5965-5675","authenticated-orcid":false,"given":"Alexander","family":"May","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3843-9491","authenticated-orcid":false,"given":"Massimo","family":"Ostuzzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,5]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-34931-7_19","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"DJ Bernstein","year":"2012","unstructured":"Bernstein, D.J., Lange, T.: Computing small discrete logarithms faster. In: Galbraith, S., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 317\u2013338. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34931-7_19"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-030-34578-5_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"W Beullens","year":"2019","unstructured":"Beullens, W., Kleinjung, T., Vercauteren, F.: CSI-FiSh: efficient isogeny based signatures through class group computations. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 227\u2013247. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_9"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-030-45724-2_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"X Bonnetain","year":"2020","unstructured":"Bonnetain, X., Schrottenloher, A.: Quantum security analysis of CSIDH. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 493\u2013522. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_17"},{"key":"12_CR4","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":"12_CR5","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"},{"issue":"3","key":"12_CR6","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s13389-021-00271-w","volume":"12","author":"J Ch\u00e1vez-Saab","year":"2022","unstructured":"Ch\u00e1vez-Saab, J., Chi-Dom\u00ednguez, J.J., Jaques, S., Rodr\u00edguez-Henr\u00edquez, F.: The SQALE of CSIDH: sublinear V\u00e9lu quantum-resistant isogeny action with low exponents. J. Cryptogr. Eng. 12(3), 349\u2013368 (2022)","journal-title":"J. Cryptogr. Eng."},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/jmc-2012-0016","volume":"8","author":"A Childs","year":"2014","unstructured":"Childs, A., 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":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-319-78375-8_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"H Corrigan-Gibbs","year":"2018","unstructured":"Corrigan-Gibbs, H., Kogan, D.: The discrete-logarithm problem with\u00a0preprocessing. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 415\u2013447. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_14"},{"key":"12_CR9","unstructured":"Couveignes, J.M.: Hard homogeneous spaces. Cryptology ePrint Archive, Report 2006\/291 (2006). https:\/\/eprint.iacr.org\/2006\/291"},{"key":"12_CR10","unstructured":"Cox, D.A.: Primes of the Form $$x^2+ ny^2$$: Fermat, Class Field Theory, and Complex Multiplication with Solutions, vol.\u00a0387. American Mathematical Society (2022)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-030-03332-3_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"L De Feo","year":"2018","unstructured":"De Feo, L., Kieffer, J., Smith, B.: Towards practical key exchange from ordinary isogeny graphs. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 365\u2013394. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_14"},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10623-014-0010-1","volume":"78","author":"C Delfs","year":"2014","unstructured":"Delfs, C., Galbraith, S.D.: Computing isogenies between supersingular elliptic curves over $$\\mathbb{{F}}_p$$. Des. Codes Crypt. 78(2), 425\u2013440 (2014). https:\/\/doi.org\/10.1007\/s10623-014-0010-1","journal-title":"Des. Codes Crypt."},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-662-45611-8_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"P-A Fouque","year":"2014","unstructured":"Fouque, P.-A., Joux, A., Mavromati, C.: Multi-user collisions: applications to discrete logarithm, even-mansour and PRINCE. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 420\u2013438. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_22"},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s00200-013-0185-0","volume":"24","author":"S Galbraith","year":"2013","unstructured":"Galbraith, S., Stolbunov, A.: Improved algorithm for the isogeny problem for ordinary elliptic curves. Appl. Algebra Eng. Commun. Comput. 24(2), 107\u2013131 (2013)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-46035-7_3","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"SD Galbraith","year":"2002","unstructured":"Galbraith, S.D., Hess, F., Smart, N.P.: Extending the GHS weil descent attack. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 29\u201344. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_3"},{"issue":"4","key":"12_CR16","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1090\/S0894-0347-1989-1002631-0","volume":"2","author":"JL Hafner","year":"1989","unstructured":"Hafner, J.L., McCurley, K.S.: A rigorous subexponential algorithm for computation of class groups. J. Am. Math. Soc. 2(4), 837\u2013850 (1989)","journal-title":"J. Am. Math. Soc."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Hallgren, S.: Fast quantum algorithms for computing the unit group and class group of a number field. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 468\u2013474 (2005)","DOI":"10.1145\/1060590.1060660"},{"key":"12_CR18","unstructured":"Heninger, N., Durumeric, Z., Wustrow, E., Halderman, J.A.: Mining your ps and qs: detection of widespread weak keys in network devices, pp. 205\u2013220 (2012)"},{"key":"12_CR19","unstructured":"Jao, D., et al.: SIKE. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-4-submissions"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-25405-5_2","volume-title":"Post-Quantum Cryptography","author":"D Jao","year":"2011","unstructured":"Jao, D., De Feo, L.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 19\u201334. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_2"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-45537-X_17","volume-title":"Selected Areas in Cryptography","author":"F Kuhn","year":"2001","unstructured":"Kuhn, F., Struik, R.: Random walks revisited: extensions of pollard\u2019s rho algorithm for computing multiple discrete logarithms. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol. 2259, pp. 212\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45537-X_17"},{"issue":"1","key":"12_CR22","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":"12_CR23","doi-asserted-by":"publisher","unstructured":"May, A., Zweydinger, F.: Legendre PRF (multiple) key attacks and the power of preprocessing, pp. 428\u2013438 (2022). https:\/\/doi.org\/10.1109\/CSF54842.2022.9919640","DOI":"10.1109\/CSF54842.2022.9919640"},{"key":"12_CR24","unstructured":"Panny, L., Petit, C., Stopar, M.: KLaPoTi: an asymptotically efficient isogeny group action from 2-dimensional isogenies. Cryptology ePrint Archive, Paper 2024\/1844 (2024). https:\/\/eprint.iacr.org\/2024\/1844"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-030-45724-2_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"C Peikert","year":"2020","unstructured":"Peikert, C.: He gives C-sieves on the CSIDH. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 463\u2013492. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_16"},{"issue":"1","key":"12_CR26","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S Pohlig","year":"1978","unstructured":"Pohlig, S., Hellman, M.: An improved algorithm for computing logarithms over $$GF (p)$$ and its cryptographic significance. IEEE Trans. Inf. Theory 24(1), 106\u2013110 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"143","key":"12_CR27","first-page":"918","volume":"32","author":"JM Pollard","year":"1978","unstructured":"Pollard, J.M.: Monte Carlo methods for index computation. Math. Comput. 32(143), 918\u2013924 (1978)","journal-title":"Math. Comput."},{"issue":"1","key":"12_CR28","first-page":"219","volume":"7","author":"R Schoof","year":"1995","unstructured":"Schoof, R.: Counting points on elliptic curves over finite fields. J. de th\u00e9orie des nombres de Bordeaux 7(1), 219\u2013254 (1995)","journal-title":"J. de th\u00e9orie des nombres de Bordeaux"},{"key":"12_CR29","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring, pp. 124\u2013134 (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"1","key":"12_CR30","doi-asserted-by":"publisher","first-page":"83","DOI":"10.4064\/aa-1-1-83-86","volume":"1","author":"C Siegel","year":"1935","unstructured":"Siegel, C.: \u00dcber die Classenzahl quadratischer Zahlk\u00f6rper. Acta Arith. 1(1), 83\u201386 (1935)","journal-title":"Acta Arith."},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Silverman, J.H.: Advanced Topics in the Arithmetic of Elliptic Curves, vol.\u00a0151. Springer, Heidelberg (1994)","DOI":"10.1007\/978-1-4612-0851-8"},{"issue":"2","key":"12_CR32","doi-asserted-by":"publisher","first-page":"215","DOI":"10.3934\/amc.2010.4.215","volume":"4","author":"A Stolbunov","year":"2010","unstructured":"Stolbunov, A.: Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves. Adv. Math. Commun. 4(2), 215\u2013235 (2010)","journal-title":"Adv. Math. Commun."},{"key":"12_CR33","first-page":"238","volume":"273","author":"J V\u00e9lu","year":"1971","unstructured":"V\u00e9lu, J.: Isog\u00e9nies entre courbes elliptiques. Comptes-Rendus de l\u2019Acad\u00e9mie des Sci. 273, 238\u2013241 (1971)","journal-title":"Comptes-Rendus de l\u2019Acad\u00e9mie des Sci."},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/978-3-662-46803-6_27","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"A Yun","year":"2015","unstructured":"Yun, A.: Generic hardness of the multiple discrete logarithm problem. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 817\u2013836. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_27"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91826-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T04:29:16Z","timestamp":1746592156000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91826-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031918254","9783031918261"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91826-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"R\u00f8ros","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2025","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":"pkc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}