{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:54:39Z","timestamp":1765961679258,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031376788"},{"type":"electronic","value":"9783031376795"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-37679-5_3","type":"book-chapter","created":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T20:31:42Z","timestamp":1689193902000},"page":"53-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Efficient Computation of\u00a0$$(3^n,3^n)$$-Isogenies"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0253-4180","authenticated-orcid":false,"given":"Thomas","family":"Decru","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6179-2094","authenticated-orcid":false,"given":"Sabrina","family":"Kunzweiler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,13]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-031-30617-4_14","volume-title":"Advances in Cryptology","author":"A Basso","year":"2023","unstructured":"Basso, A., et al.: Supersingular curves you can trust. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14005, pp. 405\u2013437. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_14"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24(3\u20134), 235\u2013265 (1997). https:\/\/doi.org\/10.1006\/jsco.1996.0125","DOI":"10.1006\/jsco.1996.0125"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1112\/S1461157014000461","volume":"18","author":"R Br\u00f6ker","year":"2015","unstructured":"Br\u00f6ker, R., Howe, E.W., Lauter, K.E., Stevenhagen, P.: Genus-2 curves and Jacobians with a given number of points. LMS J. Comput. Math. 18(1), 170\u2013197 (2015). https:\/\/doi.org\/10.1112\/S1461157014000461","journal-title":"LMS J. Comput. Math."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bruin, N., Flynn, E.V., Testa, D.: Descent via $$(3,3)$$-isogeny on Jacobians of genus 2 curves. Acta Arithmetica 165(3), 201\u2013223 (2014). http:\/\/eudml.org\/doc\/279018","DOI":"10.4064\/aa165-3-1"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Cassels, J.W.S., Flynn, E.V.: Prolegomena to a middlebrow arithmetic of curves of genus 2, vol. 230. Cambridge University Press (1996). https:\/\/doi.org\/10.1017\/CBO9780511526084","DOI":"10.1017\/CBO9780511526084"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Castryck, W., Decru, T.: Multiradical isogenies. In: 18th International Conference Arithmetic, Geometry, Cryptography, and Coding Theory, Contemporary Mathematics, vol. 779, pp. 57\u201389. American Mathematical Society (2022). https:\/\/doi.org\/10.1090\/conm\/779","DOI":"10.1090\/conm\/779"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-031-30589-4_15","volume-title":"Advances in Cryptology","author":"W Castryck","year":"2023","unstructured":"Castryck, W., Decru, T.: An efficient key recovery attack on SIDH. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14008, pp. 423\u2013447. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_15"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1515\/jmc-2019-0021","volume":"14","author":"W Castryck","year":"2020","unstructured":"Castryck, W., Decru, T., Smith, B.: Hash functions from superspecial genus-2 curves using Richelot isogenies. J. Math. Cryptol. 14(1), 268\u2013292 (2020). https:\/\/doi.org\/10.1515\/jmc-2019-0021","journal-title":"J. Math. Cryptol."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-030-64834-3_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"W Castryck","year":"2020","unstructured":"Castryck, W., Decru, T., Vercauteren, F.: Radical isogenies. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 493\u2013519. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_17"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00145-007-9002-x","volume":"22","author":"DX Charles","year":"2007","unstructured":"Charles, D.X., Lauter, K.E., Goren, E.Z.: Cryptographic hash functions from expander graphs. J. Cryptol. 22(1), 93\u2013113 (2007). https:\/\/doi.org\/10.1007\/s00145-007-9002-x","journal-title":"J. Cryptol."},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Cohen, H., et al.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press (2005). https:\/\/doi.org\/10.1201\/9781420034981","DOI":"10.1201\/9781420034981"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Cosset, R., Robert, D.: Computing $$(\\ell ,\\ell )$$-isogenies in polynomial time on Jacobians of genus 2 curves. Math. Comput. 84(294), 1953\u20131975 (2015). http:\/\/www.jstor.org\/stable\/24489183","DOI":"10.1090\/S0025-5718-2014-02899-8"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-319-78372-7_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"K Eisentr\u00e4ger","year":"2018","unstructured":"Eisentr\u00e4ger, K., Hallgren, S., Lauter, K., Morrison, T., Petit, C.: Supersingular isogeny graphs and endomorphism rings: reductions and solutions. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 329\u2013368. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_11"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-030-25510-7_16","volume-title":"Post-Quantum Cryptography","author":"EV Flynn","year":"2019","unstructured":"Flynn, E.V., Ti, Y.B.: Genus two isogeny cryptography. In: Ding, J., Steinwandt, R. (eds.) PQCrypto 2019. LNCS, vol. 11505, pp. 286\u2013306. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_16"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-79456-1_23","volume-title":"Algorithmic Number Theory","author":"SD Galbraith","year":"2008","unstructured":"Galbraith, S.D., Harrison, M., Mireles Morales, D.J.: Efficient hyperelliptic arithmetic using balanced representation for divisors. In: van der Poorten, A.J., Stein, A. (eds.) ANTS 2008. LNCS, vol. 5011, pp. 342\u2013356. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79456-1_23"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-45539-6_2","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"P Gaudry","year":"2000","unstructured":"Gaudry, P.: An algorithm for solving the discrete log problem on hyperelliptic curves. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 19\u201334. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_2"},{"key":"3_CR17","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":"485","key":"3_CR18","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1515\/crll.1997.485.93","volume":"1997","author":"E Kani","year":"1997","unstructured":"Kani, E.: The number of curves of genus two with elliptic differentials. Journal f\u00fcr die reine und angewandte Mathematik 1997(485), 93\u2013122 (1997). https:\/\/doi.org\/10.1515\/crll.1997.485.93","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"key":"3_CR19","unstructured":"Kunzweiler, S.: Efficient computation of $$(2^n,2^n)$$-isogenies. Cryptology ePrint Archive, Paper 2022\/990 (2022). https:\/\/eprint.iacr.org\/2022\/990"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-030-99277-4_23","volume-title":"Selected Areas in Cryptography","author":"S Kunzweiler","year":"2022","unstructured":"Kunzweiler, S., Ti, Y.B., Weitk\u00e4mper, C.: Secret keys in\u00a0genus-2 SIDH. In: AlTawy, R., H\u00fclsing, A. (eds.) SAC 2021. LNCS, vol. 13203, pp. 483\u2013507. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99277-4_23"},{"key":"3_CR21","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198502845.001.0001","volume-title":"Algebraic Geometry and Arithmetic Curves","author":"Q Liu","year":"2002","unstructured":"Liu, Q.: Algebraic Geometry and Arithmetic Curves, vol. 6. Oxford University Press, Oxford (2002)"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-031-30589-4_16","volume-title":"Advances in Cryptology","author":"L Maino","year":"2023","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 2023. LNCS, vol. 14008, pp. 448\u2013471. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_16"},{"key":"3_CR23","unstructured":"National Institute of Standards and Technology (NIST): Post-quantum cryptography standardization process. https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography"},{"key":"3_CR24","unstructured":"Oudompheng, R., Pope, G.: A note on reimplementing the Castryck-Decru attack and lessons learned for SageMath. Cryptology ePrint Archive, Paper 2022\/1283 (2022). https:\/\/eprint.iacr.org\/2022\/1283"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-031-30589-4_17","volume-title":"Advances in Cryptology","author":"D Robert","year":"2023","unstructured":"Robert, D.: Breaking SIDH in polynomial time. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. Lecture Notes in Computer Science, vol. 14008, pp. 472\u2013503. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_17"},{"key":"3_CR26","unstructured":"Santos, M.C.R., Costello, C., Frengley, S.: An algorithm for efficient detection of $$(N, N)$$-splittings and its application to the isogeny problem in dimension 2. Cryptology ePrint Archive, Paper 2022\/1736 (2022). https:\/\/eprint.iacr.org\/2022\/1736"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-78967-3_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"B Smith","year":"2008","unstructured":"Smith, B.: Isogenies and the discrete logarithm problem in Jacobians of genus 3 hyperelliptic curves. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 163\u2013180. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_10"},{"key":"3_CR28","series-title":"Mathematics for Industry","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-981-10-5065-7_6","volume-title":"Mathematical Modelling for Next-Generation Cryptography","author":"K Takashima","year":"2018","unstructured":"Takashima, K.: Efficient algorithms for isogeny sequences and their cryptographic applications. In: Takagi, T., Wakayama, M., Tanaka, K., Kunihiro, N., Kimoto, K., Duong, D.H. (eds.) Mathematical Modelling for Next-Generation Cryptography. MI, vol. 29, pp. 97\u2013114. Springer, Singapore (2018). https:\/\/doi.org\/10.1007\/978-981-10-5065-7_6"},{"key":"3_CR29","unstructured":"The CADO-NFS Development Team: CADO-NFS, an implementation of the number field sieve algorithm (2017). http:\/\/cado-nfs.inria.fr\/, release 2.3.0"},{"key":"3_CR30","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 9.0) (2023). https:\/\/www.sagemath.org"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37679-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,16]],"date-time":"2023-12-16T23:36:08Z","timestamp":1702769768000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37679-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031376788","9783031376795"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37679-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"13 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sousse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tunisia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2023","order":10,"name":"conference_id","label":"Conference ID","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":"59","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":"21","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":"36% - 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":"2.9","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":"3.5","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)"}}]}}