{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,31]],"date-time":"2026-05-31T04:00:32Z","timestamp":1780200032522,"version":"3.54.0"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032275738","type":"print"},{"value":"9783032275745","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-27574-5_11","type":"book-chapter","created":{"date-parts":[[2026,5,31]],"date-time":"2026-05-31T03:02:42Z","timestamp":1780196562000},"page":"165-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0(Non-)Existence of\u00a0Efficient Class Group Orbits for\u00a0Collision Search in\u00a0CSIDH"],"prefix":"10.1007","author":[{"given":"Ryo","family":"Negishi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kazuki","family":"Komine","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Akira","family":"Katayama","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Masaya","family":"Yasuda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,31]]},"reference":[{"key":"11_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":"11_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6, 1\u201313 (1986)","journal-title":"Combinatorica"},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.46586\/tches.v2021.i4.351-387","volume":"2021","author":"G Banegas","year":"2021","unstructured":"Banegas, G., et al.: CTIDH: faster constant-time CSIDH. IACR Trans. Cryptogr. Hardware Embed. Syst. 2021(4), 351\u2013387 (2021)","journal-title":"IACR Trans. Cryptogr. Hardware Embed. Syst."},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.2140\/obs.2020.4.39","volume":"4","author":"DJ Bernstein","year":"2020","unstructured":"Bernstein, D.J., De Feo, L., Leroux, A., Smith, B.: Faster computation of isogenies of large prime degree. Open Book Ser. 4(1), 39\u201355 (2020)","journal-title":"Open Book Ser."},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-030-17656-3_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"DJ Bernstein","year":"2019","unstructured":"Bernstein, D.J., Lange, T., Martindale, C., Panny, L.: Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 409\u2013441. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_15"},{"key":"11_CR6","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"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1515\/jmc-2020-0070","volume":"15","author":"J-F Biasse","year":"2020","unstructured":"Biasse, J.-F., Bonnetain, X., Pring, B., Schrottenloher, A., Youmans, W.: A trade-off between classical and quantum circuit size for an attack against CSIDH. J. Math. Cryptol. 15(1), 4\u201317 (2020)","journal-title":"J. Math. Cryptol."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Bos, J.W., Lenstra, A.K.: Topics in computational number theory inspired by. Presented at the (2017)","DOI":"10.1017\/9781316271575"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-030-44223-1_7","volume-title":"Post-Quantum Cryptography","author":"W Castryck","year":"2020","unstructured":"Castryck, W., Decru, T.: CSIDH on the Surface. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 111\u2013129. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_7"},{"key":"11_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":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-030-30530-7_9","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2019","author":"D Cervantes-V\u00e1zquez","year":"2019","unstructured":"Cervantes-V\u00e1zquez, D., Chenu, M., Chi-Dom\u00ednguez, J.-J., De Feo, L., Rodr\u00edguez-Henr\u00edquez, F., Smith, B.: Stronger and faster side-channel protections for CSIDH. In: Schwabe, P., Th\u00e9riault, N. (eds.) LATINCRYPT 2019. LNCS, vol. 11774, pp. 173\u2013193. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30530-7_9"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Chi-Dom\u00ednguez, J.-J., Esser, A., Kunzweiler, S., May, A.: Low memory attacks on small key CSIDH. In: Applied Cryptography and Network Security (ACNS 2023), volume 13906 of Lecture Notes in Computer Science, pp. 276\u2013304. Springer (2023)","DOI":"10.1007\/978-3-031-33491-7_11"},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"383","DOI":"10.3934\/amc.2020116","volume":"16","author":"J-J Chi-Dom\u00ednguez","year":"2022","unstructured":"Chi-Dom\u00ednguez, J.-J., Rodr\u00edguez-Henr\u00edquez, F.: Optimal strategies for CSIDH. Adv. Math. Commun. 16(2), 383\u2013411 (2022)","journal-title":"Adv. Math. Commun."},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-319-70697-9_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"C Costello","year":"2017","unstructured":"Costello, C., Hisil, H.: A simple and compact algorithm for SIDH with arbitrary degree isogenies. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 303\u2013329. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_11"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Dartois, P., De Feo, L.: On the security of OSIDH. In: Public-Key Cryptography-PKC 2022, volume 13177 of Lecture Notes in Computer Science, pp. 52\u201381. Springer (2022)","DOI":"10.1007\/978-3-030-97121-2_3"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Delfs, C., Galbraith, S.D.: Computing isogenies between supersingular elliptic curves over $$\\mathbb{F} _p$$. Des., Codes, Cryptogr. 78, 425\u2013440 (2016)","DOI":"10.1007\/s10623-014-0010-1"},{"key":"11_CR17","unstructured":"The Sage Developers. SageMath, the Sage Mathematics Software System (Version 10.7) (2020). http:\/\/www.sagemath.org"},{"issue":"3","key":"11_CR18","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1007\/s13160-018-0316-x","volume":"35","author":"J Ding","year":"2018","unstructured":"Ding, J., Kudo, M., Okumura, S., Takagi, T., Tao, C.: Cryptanalysis of a public key cryptosystem based on Diophantine equations via weighted LLL reduction. Jpn. J. Ind. Appl. Math. 35(3), 1123\u20131152 (2018). https:\/\/doi.org\/10.1007\/s13160-018-0316-x","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"De Feo, L., et al.: SCALLOP: scaling the CSI-FiSh. In: Public-Key Cryptography-PKC 2023, volume 13940 of Lecture Notes in Computer Science, pp. 345\u2013375. Springer (2023)","DOI":"10.1007\/978-3-031-31368-4_13"},{"key":"11_CR20","doi-asserted-by":"crossref","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)","DOI":"10.1090\/S0894-0347-1989-1002631-0"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-030-57808-4_24","volume-title":"Applied Cryptography and Network Security","author":"A Hutchinson","year":"2020","unstructured":"Hutchinson, A., LeGrow, J., Koziel, B., Azarderakhsh, R.: Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors. In: Conti, M., Zhou, J., Casalicchio, E., Spognardi, A. (eds.) ACNS 2020. LNCS, vol. 12146, pp. 481\u2013501. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57808-4_24"},{"issue":"1","key":"11_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."},{"issue":"4","key":"11_CR23","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"issue":"7","key":"11_CR24","doi-asserted-by":"publisher","first-page":"2530002","DOI":"10.1142\/S0219498825300028","volume":"23","author":"L Maino","year":"2024","unstructured":"Maino, L., Mula, M., Pintore, F.: A review of mathematical and computational aspects of CSIDH algorithms. J. Algebra Appl. 23(7), 2530002 (2024)","journal-title":"J. Algebra Appl."},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"May, A., Ostuzzi, M.: Multiple group action DLogs with(out) precomputation. In: Public-Key Cryptography-PKC 2025, volume 15676 of Lecture Notes in Computer Science, pp. 364\u2013387. Springer (2025)","DOI":"10.1007\/978-3-031-91826-1_12"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-030-25510-7_17","volume-title":"Post-Quantum Cryptography","author":"M Meyer","year":"2019","unstructured":"Meyer, M., Campos, F., Reith, S.: On lions and Elligators: an efficient constant-time implementation of CSIDH. In: Ding, J., Steinwandt, R. (eds.) PQCrypto 2019. LNCS, vol. 11505, pp. 307\u2013325. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_17"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Meyer, M., Reith, S.: A faster way to the CSIDH. In: Progress in Cryptology-INDOCRYPTO 2018, volume 11356 of Lecture Notes in Computer Science, pp. 137\u2013152. Springer (2018)","DOI":"10.1007\/978-3-030-05378-9_8"},{"issue":"4","key":"11_CR28","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s00145-024-09521-6","volume":"37","author":"H Montgomery","year":"2024","unstructured":"Montgomery, H., Zhandry, M.: Full quantum equivalence of group action DLog and CDH, and more. J. Cryptol. 37(4), 39 (2024)","journal-title":"J. Cryptol."},{"key":"11_CR29","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.dam.2022.12.002","volume":"328","author":"K Nakagawa","year":"2023","unstructured":"Nakagawa, K., Onuki, H., Takayasu, A., Takagi, T.: L$$^1$$-norm ball for CSIDH: optimal strategy for choosing the secret key space. Discret. Appl. Math. 328, 70\u201388 (2023)","journal-title":"Discret. Appl. Math."},{"key":"11_CR30","unstructured":"Neukirch, J.: Algebraic number theory, volume 322 of Graduate Texts in Mathematics. Springer Science & Business Media (2013)"},{"issue":"4","key":"11_CR31","first-page":"255","volume":"12","author":"K Okeya","year":"2002","unstructured":"Okeya, K., Miyazaki, K., Sakurai, K.: A note on the number of Montgomery-form elliptic curves for cryptosystem. Jpn. Soc. Ind. Appl. Math. 12(4), 255\u2013268 (2002)","journal-title":"Jpn. Soc. Ind. Appl. Math."},{"issue":"10","key":"11_CR32","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1587\/transfun.2019DMP0008","volume":"103","author":"H Onuki","year":"2020","unstructured":"Onuki, H., Aikawa, Y., Yamazaki, T., Takagi, T.: A constant-time algorithm of CSIDH keeping two points. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103(10), 1174\u20131182 (2020)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-030-58208-1_8","volume-title":"Advances in Information and Computer Security","author":"H Onuki","year":"2020","unstructured":"Onuki, H., Takagi, T.: On collisions related to an ideal class of order 3 in CSIDH. In: Aoki, K., Kanaoka, A. (eds.) IWSEC 2020. LNCS, vol. 12231, pp. 131\u2013148. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58208-1_8"},{"key":"11_CR34","unstructured":"Shioda, T.: On the Mordell-Weil lattices. Commentarii Mathematici Universitatis Sancti Pauli 39(2), 211\u2013240 (1990)"},{"key":"11_CR35","doi-asserted-by":"crossref","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves, volume 106 of Graduate Texts in Mathematics, second edition . Springer, New York(2009)","DOI":"10.1007\/978-0-387-09494-6"},{"key":"11_CR36","unstructured":"Silverman, J.H.: Advanced topics in the arithmetic of elliptic curves, volume 151 of Graduate Texts in Mathematics. Springer Science & Business Media (2013)"},{"key":"11_CR37","unstructured":"V\u00e9lu, J.: Isog\u00e9nies entre courbes elliptiques. Comptes-Rendus de l\u2019Acad\u00e9mie des Sci. 273, 238\u2013241 (1971)"},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"Voight, J.: Quaternion Algebras, volume 288 of Graduate Texts in Mathematics. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-56694-4"},{"key":"11_CR39","doi-asserted-by":"publisher","DOI":"10.1201\/9781420071474","volume-title":"Elliptic Curves: Number Theory and Cryptography","author":"LC Washington","year":"2008","unstructured":"Washington, L.C.: Elliptic Curves: Number Theory and Cryptography, 2nd edn. CRC Press, Boca Raton (2008)","edition":"2"},{"key":"11_CR40","doi-asserted-by":"crossref","unstructured":"Waterhouse, W.C.: Abelian varieties over finite fields. Annales Scientifiques de L\u2019\u00c9.N.S 2(4), 521\u2013560 (1969)","DOI":"10.24033\/asens.1183"}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27574-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,31]],"date-time":"2026-05-31T03:02:49Z","timestamp":1780196569000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27574-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032275738","9783032275745"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27574-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"31 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAIFI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on the Arithmetic of Finite Fields","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santander","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waifi2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.waifi.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}