{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T09:50:56Z","timestamp":1775296256460,"version":"3.50.1"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030053772","type":"print"},{"value":"9783030053789","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-05378-9_9","type":"book-chapter","created":{"date-parts":[[2018,12,4]],"date-time":"2018-12-04T20:03:38Z","timestamp":1543953818000},"page":"153-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A Note on the Security of CSIDH"],"prefix":"10.1007","author":[{"given":"Jean-Fran\u00e7ois","family":"Biasse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annamaria","family":"Iezzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"Michael J.","family":"Jacobson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,5]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Adj, G., Cervantes-V\u00e1zquez, D., Chi-Dom\u00ednguez, J.-J., Menezes, A., Rodr\u00edguez-Henr\u00edquez, F.: The cost of computing isogenies between supersingular elliptic curves. Cryptology ePrint Archive, Report 2018\/313 (2018). https:\/\/eprint.iacr.org\/2018\/313","DOI":"10.1007\/978-3-030-10970-7_15"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-72565-9_3","volume-title":"Selected Areas in Cryptography \u2013 SAC 2017","author":"R Azarderakhsh","year":"2018","unstructured":"Azarderakhsh, R., Jao, D., Leonardi, C.: Post-quantum static-static key agreement using multiple protocol instances. In: Adams, C., Camenisch, J. (eds.) SAC 2017. LNCS, vol. 10719, pp. 45\u201363. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72565-9_3"},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/0218053","volume":"18","author":"CH Bennett","year":"1989","unstructured":"Bennett, C.H.: Time\/space trade-offs for reversible computation. SIAM J. Comput. 18(4), 766\u2013776 (1989)","journal-title":"SIAM J. Comput."},{"issue":"A","key":"9_CR4","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1112\/S1461157016000358","volume":"19","author":"J-F Biasse","year":"2016","unstructured":"Biasse, J.-F., Fieker, C., Jacobson Jr., M.J.: Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation. LMS J. Comput. Math. 19(A), 371\u2013390 (2016)","journal-title":"LMS J. Comput. Math."},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-319-13039-2_25","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2014","author":"J-F Biasse","year":"2014","unstructured":"Biasse, J.-F., Jao, D., Sankar, A.: A quantum algorithm for computing isogenies between supersingular elliptic curves. In: Meier, W., Mukhopadhyay, D. (eds.) INDOCRYPT 2014. LNCS, vol. 8885, pp. 428\u2013442. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13039-2_25"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Biasse, J.-F., Song, F.: Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields. In: Krauthgamer, R. (ed.) Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10\u201312 January 2016, pp. 893\u2013902. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch64"},{"key":"9_CR7","unstructured":"Bonnetain, X., Schrottenloher, A.: Quantum security analysis of CSIDH and ordinary isogeny-based schemes. Cryptology ePrint Archive, Report 2018\/537 (2018). https:\/\/eprint.iacr.org\/2018\/537"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"283","DOI":"10.5802\/jtnb.170","volume":"8","author":"W Bosma","year":"1996","unstructured":"Bosma, W., Stevenhagen, P.: On the computation of quadratic 2-class groups. Journal de Th\u00e9orie des Nombres de Bordeaux 8(2), 283\u2013313 (1996)","journal-title":"Journal de Th\u00e9orie des Nombres de Bordeaux"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-85538-5_7","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"R Br\u00f6ker","year":"2008","unstructured":"Br\u00f6ker, R., Charles, D., Lauter, K.: Evaluating large degree isogenies and applications to pairing based cryptography. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 100\u2013112. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85538-5_7"},{"key":"9_CR10","first-page":"395","volume-title":"Lecture Notes in Computer Science","author":"Wouter Castryck","year":"2018","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. Cryptology ePrint Archive, Report 2018\/383 (2018). https:\/\/eprint.iacr.org\/2018\/383. to appear in Asiacrypt 2018"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/jmc-2012-0016","volume":"8","author":"A Childs","year":"2013","unstructured":"Childs, A., Jao, D., Soukharev, V.: Constructing elliptic curve isogenies in quantum subexponential time. J. Math. Cryptol. 8(1), 1\u201329 (2013)","journal-title":"J. Math. Cryptol."},{"key":"9_CR12","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","first-page":"xii+534","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A Course in Computational Algebraic Number Theory","author":"H Cohen","year":"1993","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics, vol. 138, p. xii+534. Springer, Berlin (1993). https:\/\/doi.org\/10.1007\/978-3-662-02945-9"},{"key":"9_CR13","unstructured":"Couveignes, J.-M.: Hard homogeneous spaces. http:\/\/eprint.iacr.org\/2006\/291"},{"issue":"6","key":"9_CR14","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Helman, M.: New directions in cryptography. IEEE Trans. Inf. Soc. 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Soc."},{"key":"9_CR15","unstructured":"Feo, L.D., Kieffer, J., Smith, B.: Towards practical key exchange from ordinary isogeny graphs. Cryptology ePrint Archive, Report 2018\/485 (2018). https:\/\/eprint.iacr.org\/2018\/485. to appear in Asiacrypt 2018"},{"key":"9_CR16","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"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-662-53887-6_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"SD Galbraith","year":"2016","unstructured":"Galbraith, S.D., Petit, C., Shani, B., Ti, Y.B.: On the security of supersingular isogeny cryptosystems. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 63\u201391. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_3"},{"key":"9_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-7560-0","volume-title":"Disquisitiones Arithmeticae","author":"CF Gau\u00df","year":"1986","unstructured":"Gau\u00df, C.F., Waterhouse, W.C.: Disquisitiones Arithmeticae. Springer, New York (1986). https:\/\/doi.org\/10.1007\/978-1-4939-7560-0. translated by A.A. Clark"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1090\/S0894-0347-1989-1002631-0","volume":"2","author":"J Hafner","year":"1989","unstructured":"Hafner, J., McCurley, K.: A rigorous subexponential algorithm for computation of class groups. J. Am. Math. Soc. 2, 839\u2013850 (1989)","journal-title":"J. Am. Math. Soc."},{"issue":"1","key":"9_CR20","first-page":"129","volume":"6","author":"S Hamdy","year":"2006","unstructured":"Hamdy, S., Saidak, F.: Arithmetic properties of class numbers of imaginary quadratic fields. JP J. Algebra Number Theory Appl. 6(1), 129\u2013148 (2006)","journal-title":"JP J. Algebra Number Theory Appl."},{"key":"9_CR21","unstructured":"Hanrot, G., Pujol, X., Stehl\u00e9, D.: Terminating BKZ. IACR Cryptology ePrint Archive 2011, 198 (2011)"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-74143-5_10","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"G Hanrot","year":"2007","unstructured":"Hanrot, G., Stehl\u00e9, D.: Improved analysis of kannan\u2019s shortest lattice vector algorithm. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 170\u2013186. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_10"},{"key":"9_CR23","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":"9_CR24","unstructured":"Jao, D., LeGrow, J., Leonardi, C., Ruiz-Lopez, L.: A subexponential-time, polynomial quantum space algorithm for inverting the cm action. In: Slides of Presentation at the MathCrypt Conference (2018). https:\/\/drive.google.com\/file\/d\/15nkb9j0GKyLujYfAb8Sfz3TjBY5PWOCT\/view"},{"key":"9_CR25","first-page":"1","volume":"14","author":"A Kabatyanskii","year":"1978","unstructured":"Kabatyanskii, A., Levenshtein, V.: Bounds for packings. On a sphere and in space. Proulcmy Peredacha informats\u00fc 14, 1\u201317 (1978)","journal-title":"Proulcmy Peredacha informats\u00fc"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: Johnson, D., et al. (eds.) Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25\u201327 April, 1983, Boston, Massachusetts, USA, pp. 193\u2013206. ACM (1983)","DOI":"10.1145\/800061.808749"},{"key":"9_CR27","unstructured":"Kuperberg, G.: Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem. In: Severini, S., Brand\u00e3o, F. (eds.) 8th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2013, May 21\u201323, 2013, Guelph, Canada, vol. 22 of LIPIcs, pp. 20\u201334. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)"},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/BF02940586","volume":"1","author":"T Nagell","year":"1922","unstructured":"Nagell, T.: \u00dcber die Klassenzahl imagin\u00e4r-quadratischer Zahlk\u00f6rper. Abh. Math. Sem. Univ. Hamburg 1, 140\u2013150 (1922)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"9_CR29","unstructured":"National Institute of Standards and Technology. Post quantum cryptography project (2018). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography"},{"key":"9_CR30","unstructured":"Regev, O.: A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space. arXiv:quant-ph\/0406151"},{"issue":"2","key":"9_CR31","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"CP Schnorr","year":"1994","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66(2), 181\u2013199 (1994)","journal-title":"Math. Program."},{"issue":"116","key":"9_CR32","first-page":"837","volume":"25","author":"D Shanks","year":"1971","unstructured":"Shanks, D.: Gauss\u2019s ternary form reduction and the 2-sylow subgroup. Math. Comput. 25(116), 837\u2013853 (1971)","journal-title":"Math. Comput."},{"key":"9_CR33","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","first-page":"xii+400","DOI":"10.1007\/978-1-4757-1920-8","volume-title":"The Arithmetic of Elliptic Curves","author":"JH Silverman","year":"1992","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves. Graduate Texts in Mathematics, vol. 106, p. xii+400. Springer, New York (1992). https:\/\/doi.org\/10.1007\/978-1-4757-1920-8"},{"issue":"2","key":"9_CR34","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":"9_CR35","unstructured":"Storjohann, A.: Algorithms for Matrix Canonical Forms. Ph.D. thesis, Department of Computer Science, Swiss Federal Institute of Technology - ETH (2000)"},{"key":"9_CR36","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BF01404549","volume":"2","author":"J Tate","year":"1966","unstructured":"Tate, J.: Endomoprhisms of abelian varieties over finite fields. Inventiones Mathematica 2, 134\u2013144 (1966)","journal-title":"Inventiones Mathematica"},{"key":"9_CR37","unstructured":"V\u00e9lu, J.: Isog\u00e9nies entre courbes elliptiques. C. R. Acad. Sci. Paris S\u00e9r. A-B 273, A238\u2013A241 (1971)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05378-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T09:03:25Z","timestamp":1775293405000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-05378-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030053772","9783030053789"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05378-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"5 December 2018","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":"New Delhi","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isical.ac.in\/~indocrypt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}