{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T22:33:50Z","timestamp":1775774030137,"version":"3.50.1"},"publisher-location":"Cham","reference-count":64,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018540","type":"print"},{"value":"9783032018557","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-032-01855-7_4","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T19:41:25Z","timestamp":1755373285000},"page":"100-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Deterministic Algorithms for\u00a0Class Group Actions"],"prefix":"10.1007","author":[{"given":"Marc","family":"Houben","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"4_CR1","unstructured":"GitHub repository associated to this paper. https:\/\/github.com\/houbenmr\/DeterministicClassGroupActions"},{"key":"4_CR2","unstructured":"Allombert, B., et al.: PEARL-SCALLOP: Parameter Extension Applicable in Real-Life SCALLOP. Cryptology ePrint Archive, Report 2024\/1744 (2024). https:\/\/eprint.iacr.org\/2024\/1744"},{"issue":"11","key":"4_CR3","doi-asserted-by":"publisher","first-page":"3447","DOI":"10.1007\/s10623-024-01435-5","volume":"92","author":"S Arpin","year":"2024","unstructured":"Arpin, S., Clements, J., Dartois, P., Eriksen, J.K., Kutas, P., Wesolowski, B.: Finding orientations of supersingular elliptic curves and quaternion orders. DCC 92(11), 3447\u20133493 (2024). https:\/\/doi.org\/10.1007\/s10623-024-01435-5","journal-title":"DCC"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Banegas, G., et al.: CTIDH: faster constant-time CSIDH. IACR TCHES 2021(4), 351\u2013387 (2021). https:\/\/doi.org\/10.46586\/tches.v2021.i4.351-387, https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/9069","DOI":"10.46586\/tches.v2021.i4.351-387"},{"key":"4_CR5","unstructured":"Banegas, G., Gilchrist, V., Smith, B.: Efficient supersingularity testing over $$\\mathbb{F}_p$$ and CSIDH key validation. Cryptology ePrint Archive, Report 2022\/880 (2022). https:\/\/eprint.iacr.org\/2022\/880"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Banegas, G., et al.: Disorientation faults in CSIDH. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 310\u2013342. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_11","DOI":"10.1007\/978-3-031-30589-4_11"},{"key":"4_CR7","unstructured":"Bernstein, D.J., De Feo, L., Leroux, A., Smith, B.: Faster computation of isogenies of large prime degree. Cryptology ePrint Archive, Report 2020\/341 (2020). https:\/\/eprint.iacr.org\/2020\/341"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., Hamburg, M., Krasnova, A., Lange, T.: Elligator: elliptic-curve points indistinguishable from uniform random strings. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 967\u2013980. ACM Press, November 2013. https:\/\/doi.org\/10.1145\/2508859.2516734","DOI":"10.1145\/2508859.2516734"},{"key":"4_CR9","doi-asserted-by":"publisher","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\u00a02019, Part\u00a0II. LNCS, vol. 11477, pp. 409\u2013441. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_15","DOI":"10.1007\/978-3-030-17656-3_15"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Bonnetain, X., Schrottenloher, A.: Quantum security analysis of CSIDH. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0II. LNCS, vol. 12106, pp. 493\u2013522. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_17","DOI":"10.1007\/978-3-030-45724-2_17"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Campos, F., et al.: Optimizations and practicality of high-security CSIDH. CiC 1(1), 5 (2024). https:\/\/doi.org\/10.62056\/anjbksdja","DOI":"10.62056\/anjbksdja"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Campos, F., Hellenbrand, A., Meyer, M., Reijnders, K.: dCTIDH: Fast & Deterministic CTIDH. Cryptology ePrint Archive, Report 2025\/107 (2025). https:\/\/eprint.iacr.org\/2025\/107","DOI":"10.46586\/tches.v2025.i3.516-541"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Campos, F., Kannwischer, M.J., Meyer, M., Onuki, H., St\u00f6ttinger, M.: Trouble at the CSIDH: Protecting CSIDH with dummy-operations against fault injection attacks. Cryptology ePrint Archive, Report 2020\/1005 (2020). https:\/\/eprint.iacr.org\/2020\/1005","DOI":"10.1109\/FDTC51366.2020.00015"},{"key":"4_CR14","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":"4_CR15","doi-asserted-by":"publisher","unstructured":"Castryck, W., Decru, T.: An efficient key recovery attack on SIDH. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 423\u2013447. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_15","DOI":"10.1007\/978-3-031-30589-4_15"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Castryck, W., Decru, T., Houben, M., Vercauteren, F.: Horizontal racewalking using radical isogenies. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13792, pp. 67\u201396. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_3","DOI":"10.1007\/978-3-031-22966-4_3"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Castryck, W., Decru, T., Vercauteren, F.: Radical isogenies. In: Moriai, S., Wang, H. (eds.) ASIACRYPT\u00a02020, Part\u00a0II. LNCS, vol. 12492, pp. 493\u2013519. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_17","DOI":"10.1007\/978-3-030-64834-3_17"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Castryck, W., Houben, M., Merz, S.P., Mula, M., van Buuren, S., Vercauteren, F.: Weak instances of class group action based cryptography via self-pairings. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0III. LNCS, vol. 14083, pp. 762\u2013792. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_25","DOI":"10.1007\/978-3-031-38548-3_25"},{"issue":"4","key":"4_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s40993-022-00399-6","volume":"8","author":"W Castryck","year":"2022","unstructured":"Castryck, W., Houben, M., Vercauteren, F., Wesolowski, B.: On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves. Res. Number Theory 8(4), 99 (2022). https:\/\/doi.org\/10.1007\/s40993-022-00399-6","journal-title":"Res. Number Theory"},{"key":"4_CR20","doi-asserted-by":"publisher","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\u00a02018, Part\u00a0III. LNCS, vol. 11274, pp. 395\u2013427. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_15","DOI":"10.1007\/978-3-030-03332-3_15"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Castryck, W., Panny, L., Vercauteren, F.: Rational isogenies from irrational endomorphisms. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0II. LNCS, vol. 12106, pp. 523\u2013548. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_18","DOI":"10.1007\/978-3-030-45724-2_18"},{"key":"4_CR22","doi-asserted-by":"publisher","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\u00a02019. LNCS, vol. 11774, pp. 173\u2013193. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30530-7_9","DOI":"10.1007\/978-3-030-30530-7_9"},{"issue":"3","key":"4_CR23","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). https:\/\/doi.org\/10.1007\/s13389-021-00271-w","journal-title":"J. Cryptogr. Eng."},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Chen, M., Leroux, A., Panny, L.: SCALLOP-HD: group action from 2-dimensional isogenies. In: Tang, Q., Teague, V. (eds.) PKC\u00a02024, Part\u00a0II. LNCS, vol. 14603, pp. 190\u2013216. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57725-3_7","DOI":"10.1007\/978-3-031-57725-3_7"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Cheng, H., Fotiadis, G., Gro\u00dfsch\u00e4dl, J., Ryan, P.Y.A., R\u00f8nne, P.B.: Batching CSIDH group actions using AVX-512. IACR TCHES 2021(4), 618\u2013649 (2021). https:\/\/doi.org\/10.46586\/tches.v2021.i4.618-649, https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/9077","DOI":"10.46586\/tches.v2021.i4.618-649"},{"key":"4_CR26","unstructured":"Chenu, M., Smith, B.: Higher-degree supersingular group actions. Cryptology ePrint Archive, Report 2021\/955 (2021). https:\/\/eprint.iacr.org\/2021\/955"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Chi-Dom\u00ednguez, J.J., Esser, A., Kunzweiler, S., May, A.: Low memory attacks on small key CSIDH. In: Tibouchi, M., Wang, X. (eds.) ACNS 23International Conference on Applied Cryptography and Network Security, Part\u00a0II. LNCS, vol. 13906, pp. 276\u2013304. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-33491-7_11","DOI":"10.1007\/978-3-031-33491-7_11"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"Chi-Dom\u00ednguez, J.J., Reijnders, K.: Fully projective radical isogenies in constant-time. In: Galbraith, S.D. (ed.) CT-RSA\u00a02022. LNCS, vol. 13161, pp. 73\u201395. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-95312-6_4","DOI":"10.1007\/978-3-030-95312-6_4"},{"key":"4_CR29","unstructured":"Chi-Dom\u00ednguez, J.J., Rodr\u00edguez-Henr\u00edquez, F.: Optimal strategies for CSIDH. Cryptology ePrint Archive, Report 2020\/417 (2020). https:\/\/eprint.iacr.org\/2020\/417"},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Springer Publishing Company, Incorporated, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-662-02945-9","DOI":"10.1007\/978-3-662-02945-9"},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1515\/jmc-2019-0034","volume":"14","author":"L Col\u00f2","year":"2020","unstructured":"Col\u00f2, L., Kohel, D.: Orienting supersingular isogeny graphs. J. Math. Cryptol. 14, 414\u2013437 (2020). https:\/\/doi.org\/10.1515\/jmc-2019-0034","journal-title":"J. Math. Cryptol."},{"key":"4_CR32","unstructured":"Conrad, K.: The conductor ideal of an order. Expos. Paper. 1, 2 (2024). https:\/\/kconrad.math.uconn.edu\/blurbs\/gradnumthy\/conductor.pdf"},{"key":"4_CR33","doi-asserted-by":"publisher","unstructured":"Costello, C., Jao, D., Longa, P., Naehrig, M., Renes, J., Urbanik, D.: Efficient compression of SIDH public keys. In: Coron, J.S., Nielsen, J.B. (eds.) EUROCRYPT\u00a02017, Part\u00a0I. LNCS, vol. 10210, pp. 679\u2013706. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_24","DOI":"10.1007\/978-3-319-56620-7_24"},{"key":"4_CR34","unstructured":"Couveignes, J.M.: Hard homogeneous spaces. Cryptology ePrint Archive, Report 2006\/291 (2006). https:\/\/eprint.iacr.org\/2006\/291"},{"key":"4_CR35","doi-asserted-by":"publisher","unstructured":"Dartois, P., De Feo, L.: On the security of OSIDH. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) PKC\u00a02022, Part\u00a0I. LNCS, vol. 13177, pp. 52\u201381. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97121-2_3","DOI":"10.1007\/978-3-030-97121-2_3"},{"key":"4_CR36","doi-asserted-by":"publisher","unstructured":"De Feo, L., et al.: SCALLOP: Scaling the CSI-FiSh. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023, Part\u00a0I. LNCS, vol. 13940, pp. 345\u2013375. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_13","DOI":"10.1007\/978-3-031-31368-4_13"},{"key":"4_CR37","doi-asserted-by":"publisher","unstructured":"Decru, T.: Radical isogeny *inline image* formulae. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0V. LNCS, vol. 14924, pp. 107\u2013128. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68388-6_5","DOI":"10.1007\/978-3-031-68388-6_5"},{"key":"4_CR38","unstructured":"Gajland, P., de\u00a0Kock, B., Quaresma, M., Malavolta, G., Schwabe, P.: SWOOSH: efficient lattice-based non-interactive key exchange. In: Balzarotti, D., Xu, W. (eds.) USENIX Security 2024. USENIX Association (2024)"},{"key":"4_CR39","doi-asserted-by":"publisher","unstructured":"Hutchinson, A., LeGrow, J.T., 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 20International Conference on Applied Cryptography and Network Security, Part\u00a0I. LNCS, vol. 12146, pp. 481\u2013501. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57808-4_24","DOI":"10.1007\/978-3-030-57808-4_24"},{"key":"4_CR40","doi-asserted-by":"publisher","unstructured":"Jalali, A., Azarderakhsh, R., Kermani, M.M., Jao, D.: Towards optimized and constant-time CSIDH on embedded devices. In: Polian, I., St\u00f6ttinger, M. (eds.) COSADE 2019. LNCS, vol. 11421, pp. 215\u2013231. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16350-1_12","DOI":"10.1007\/978-3-030-16350-1_12"},{"key":"4_CR41","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"},{"issue":"1","key":"4_CR42","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). https:\/\/doi.org\/10.1137\/S0097539703436345","journal-title":"SIAM J. Comput."},{"key":"4_CR43","doi-asserted-by":"publisher","unstructured":"Kuperberg, G.: Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem. In: 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a022, pp. 20\u201334 (2013). https:\/\/doi.org\/10.4230\/LIPIcs.TQC.2013.20","DOI":"10.4230\/LIPIcs.TQC.2013.20"},{"key":"4_CR44","unstructured":"LeGrow, J., Hutchinson, A.: An analysis of fault attacks on CSIDH. Cryptology ePrint Archive, Report 2020\/1006 (2020). https:\/\/eprint.iacr.org\/2020\/1006"},{"issue":"3","key":"4_CR45","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s13389-023-00318-0","volume":"13","author":"JT LeGrow","year":"2023","unstructured":"LeGrow, J.T.: A faster method for fault attack resistance in static\/ephemeral CSIDH. J. Cryptogr. Eng. 13(3), 283\u2013294 (2023). https:\/\/doi.org\/10.1007\/s13389-023-00318-0","journal-title":"J. Cryptogr. Eng."},{"key":"4_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-030-85987-9_12","volume-title":"Advances in Information and Computer Security","author":"JT LeGrow","year":"2021","unstructured":"LeGrow, J.T., Hutchinson, A.: (Short Paper) analysis of a strong fault attack on static\/ephemeral CSIDH. In: Nakanishi, T., Nojima, R. (eds.) IWSEC 2021. LNCS, vol. 12835, pp. 216\u2013226. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85987-9_12"},{"key":"4_CR47","unstructured":"Leonardi, C.: A note on the ending elliptic curve in SIDH. Cryptology ePrint Archive, Report 2020\/262 (2020). https:\/\/eprint.iacr.org\/2020\/262"},{"key":"4_CR48","doi-asserted-by":"publisher","unstructured":"Maino, L., Martindale, C., Panny, L., Pope, G., Wesolowski, B.: A direct key recovery attack on SIDH. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 448\u2013471. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_16","DOI":"10.1007\/978-3-031-30589-4_16"},{"key":"4_CR49","doi-asserted-by":"publisher","unstructured":"Meyer, M., Campos, F., Reith, S.: On lions and elligators: an efficient constant-time implementation of CSIDH. In: Ding, J., Steinwandt, R. (eds.) Post-Quantum Cryptography - 10th International Conference, PQCrypto 2019. pp. 307\u2013325. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_17","DOI":"10.1007\/978-3-030-25510-7_17"},{"key":"4_CR50","doi-asserted-by":"publisher","unstructured":"Meyer, M., Reith, S.: A faster way to the CSIDH. In: Chakraborty, D., Iwata, T. (eds.) INDOCRYPT\u00a02018. LNCS, vol. 11356, pp. 137\u2013152. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-05378-9_8","DOI":"10.1007\/978-3-030-05378-9_8"},{"key":"4_CR51","doi-asserted-by":"publisher","unstructured":"Moriya, T., Onuki, H., Takagi, T.: How to construct CSIDH on Edwards curves. In: Jarecki, S. (ed.) CT-RSA\u00a02020. LNCS, vol. 12006, pp. 512\u2013537. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_22","DOI":"10.1007\/978-3-030-40186-3_22"},{"key":"4_CR52","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2020.101777","volume":"69","author":"H Onuki","year":"2021","unstructured":"Onuki, H.: On oriented supersingular elliptic curves. Finite Fields App. 69, 101777 (2021). https:\/\/doi.org\/10.1016\/j.ffa.2020.101777","journal-title":"Finite Fields App."},{"key":"4_CR53","doi-asserted-by":"publisher","unstructured":"Onuki, H., Aikawa, Y., Yamazaki, T., Takagi, T.: (Short paper) A faster constant-time algorithm of CSIDH keeping two points. In: Attrapadung, N., Yagi, T. (eds.) IWSEC 19. LNCS, vol. 11689, pp. 23\u201333. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26834-3_2","DOI":"10.1007\/978-3-030-26834-3_2"},{"key":"4_CR54","doi-asserted-by":"publisher","unstructured":"Onuki, H., Takagi, T.: On collisions related to an ideal class of order 3 in CSIDH. In: Aoki, K., Kanaoka, A. (eds.) IWSEC 20. LNCS, vol. 12231, pp. 131\u2013148. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58208-1_8","DOI":"10.1007\/978-3-030-58208-1_8"},{"key":"4_CR55","unstructured":"Panny, L.: An open-source implementation of the CSIDH protocol. https:\/\/yx7.cc\/code\/csidh\/csidh-20180826.tar.xz"},{"key":"4_CR56","doi-asserted-by":"publisher","unstructured":"Peikert, C.: He gives C-sieves on the CSIDH. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0II. LNCS, vol. 12106, pp. 463\u2013492. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_16","DOI":"10.1007\/978-3-030-45724-2_16"},{"key":"4_CR57","unstructured":"Pope, G.: An implementation of isogenies between Kummer Lines of Montgomery curves using $$x$$-only arithmetic. https:\/\/github.com\/GiacomoPope\/KummerIsogeny"},{"key":"4_CR58","unstructured":"Regev, O.: A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space (2004). https:\/\/arxiv.org\/pdf\/quant-ph\/0406151"},{"key":"4_CR59","doi-asserted-by":"publisher","unstructured":"Reijnders, K.: Effective pairings in isogeny-based cryptography. In: Aly, A., Tibouchi, M. (eds.) LATINCRYPT\u00a02023. LNCS, vol. 14168, pp. 109\u2013128. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-44469-2_6","DOI":"10.1007\/978-3-031-44469-2_6"},{"key":"4_CR60","doi-asserted-by":"publisher","unstructured":"Robert, D.: Breaking SIDH in polynomial time. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0V. LNCS, vol. 14008, pp. 472\u2013503. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_17","DOI":"10.1007\/978-3-031-30589-4_17"},{"key":"4_CR61","unstructured":"Rostovtsev, A., Stolbunov, A.: Public-Key Cryptosystem Based On Isogenies. Cryptology ePrint Archive, Report 2006\/145 (2006). https:\/\/eprint.iacr.org\/2006\/145"},{"issue":"1","key":"4_CR62","doi-asserted-by":"publisher","first-page":"507","DOI":"10.2140\/obs.2013.1.507","volume":"1","author":"A Sutherland","year":"2013","unstructured":"Sutherland, A.: Isogeny volcanoes. Open Book Ser. 1(1), 507\u2013530 (2013). https:\/\/doi.org\/10.2140\/obs.2013.1.507","journal-title":"Open Book Ser."},{"key":"4_CR63","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 Sciences 273, 238\u2013241 (1971)","journal-title":"Comptes-Rendus de l\u2019Acad\u00e9mie des Sciences"},{"key":"4_CR64","unstructured":"Robert, D.: Fast pairings via biextensions and cubical arithmetic (2024). https:\/\/eprint.iacr.org\/2024\/517"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01855-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T19:21:39Z","timestamp":1768850499000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01855-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018540","9783032018557"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01855-7_4","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":"17 August 2025","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}