{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T12:48:29Z","timestamp":1765370909130,"version":"3.46.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032133007","type":"print"},{"value":"9783032133014","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"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-13301-4_9","type":"book-chapter","created":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:12:47Z","timestamp":1765357967000},"page":"194-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hardened CTIDH: Dummy-Free and\u00a0Deterministic CTIDH"],"prefix":"10.1007","author":[{"given":"Gustavo","family":"Banegas","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Hellenbrand","sequence":"additional","affiliation":[]},{"given":"Matheus","family":"Saldanha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,11]]},"reference":[{"issue":"4","key":"9_CR1","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. Hardw. Embed. Syst. 2021(4), 351\u2013387 (2021)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s40993-024-00604-8","volume":"11","author":"DJ Bernstein","year":"2025","unstructured":"Bernstein, D.J., Cottaar, J., Lange, T.: Searching for differential addition chains. Res. Number Theory 11(2), 45 (2025)","journal-title":"Res. Number Theory"},{"key":"9_CR3","doi-asserted-by":"crossref","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)","DOI":"10.2140\/obs.2020.4.39"},{"key":"9_CR4","doi-asserted-by":"crossref","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.) Advances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Germany, 19\u201323 May 2019, Proceedings, Part II, volume 11477 of Lecture Notes in Computer Science, Darmstadt, pp. 409\u2013441. Springer (2019)","DOI":"10.1007\/978-3-030-17656-3_15"},{"key":"9_CR5","unstructured":"Optimizations and practicality of high-security CSIDH. IACR Commun. Cryptol. 1(1), 5 (2024)"},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"516","DOI":"10.46586\/tches.v2025.i3.516-541","volume":"2025","author":"F Campos","year":"2025","unstructured":"Campos, F., Hellenbrand, A., Meyer, M., Reijnders, K.: dCTIDH: fast & deterministic CTIDH. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2025(3), 516\u2013541 (2025)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"9_CR7","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. In 17th Workshop on Fault Detection and Tolerance in Cryptography, FDTC 2020, 13 September 2020,, Milan, Italy, pp. 57\u201365. IEEE (2020)","DOI":"10.1109\/FDTC51366.2020.00015"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Castryck, W., Decru, T.: An efficient key recovery attack on SIDH. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, 23\u201327 April 2023, Proceedings, Part V, volume 14008 of Lecture Notes in Computer Science, Lyon, France, pp. 423\u2013447. Springer (2023)","DOI":"10.1007\/978-3-031-30589-4_15"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. In: Peyrin, T., Galbraith, S.D. (eds.) Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, 2\u20136 December 2018, Proceedings, Part III, volume 11274 of Lecture Notes in Computer Science, Brisbane, QLD, Australia, pp. 395\u2013427. Springer (2018)","DOI":"10.1007\/978-3-030-03332-3_15"},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.46586\/tches.v2025.i4.644-666","volume":"2025","author":"J-J Chi-Dom\u00ednguez","year":"2025","unstructured":"Chi-Dom\u00ednguez, J.-J., Ochoa-Jim\u00e9nez, E., Rodas, R.N.P.: Let us walk on the 3-isogeny graph: efficient, fast, and simple. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2025(4), 644\u2013666 (2025)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"issue":"2","key":"9_CR11","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":"9_CR12","doi-asserted-by":"crossref","unstructured":"Chiu, T., LeGrow, J., Xiong, W.: Practical fault injection attacks on constant time CSIDH and mitigation techniques. In: Chang, C.-H., R\u00fchrmair, U., Szefer, J., Batina, L., Regazzoni, F. (eds.) Proceedings of the 2024 Workshop on Attacks and Solutions in Hardware Security, ASHES 2024, 14\u2013 18 October 2024, Salt Lake City, UT, USA, pp. 11\u201322. ACM (2024)","DOI":"10.1145\/3689939.3695789"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Maino, L., Martindale, C., Panny, L., Pope, G., Wesolowski, B.: A direct key recovery attack on SIDH. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, 23\u201327 April 2023, Proceedings, Part V, volume 14008 of Lecture Notes in Computer Science, Lyon, France, pages 448\u2013471. Springer, (2023)","DOI":"10.1007\/978-3-031-30589-4_16"},{"key":"9_CR14","doi-asserted-by":"crossref","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, pp. 307\u2013325. Springer International Publishing, Cham (2019)","DOI":"10.1007\/978-3-030-25510-7_17"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Onuki, H., Aikawa, Y., Yamazaki, T., Takagi, T.: A constant-time algorithm of CSIDH keeping two points. IEICE Trans. Fundam. Electr., Commun. Comput. Sci. E103-A(10), 1174\u20131182 (2020)","DOI":"10.1587\/transfun.2019DMP0008"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Peikert, C.: He gives c-sieves on the CSIDH. In: Canteaut, A., Ishai, Y. (eds.) Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 10\u201314 May 2020, Proceedings, Part II, volume 12106 of Lecture Notes in Computer Science, Zagreb, Croatia, pp. 463\u2013492. Springer (2020)","DOI":"10.1007\/978-3-030-45724-2_16"},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.62056\/ah2i893y6","volume":"2","author":"G Pope","year":"2025","unstructured":"Pope, G., Reijnders, K., Robert, D., Sferlazza, A., Smith, B.: Simpler and faster pairings from the montgomery ladder. IACR Commun. Cryptol. 2(2), 29 (2025)","journal-title":"IACR Commun. Cryptol."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Robert, D.: Breaking SIDH in polynomial time. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, 23\u201327 April 2023, Proceedings, Part V, volume 14008 of Lecture Notes in Computer Science, Lyon, France, pp. 472\u2013503. Springer (2023)","DOI":"10.1007\/978-3-031-30589-4_17"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves. Graduate Texts in Mathematics, 2 ed. Springer, New York (2009)","DOI":"10.1007\/978-0-387-09494-6"},{"key":"9_CR20","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"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-13301-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:12:50Z","timestamp":1765357970000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-13301-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,11]]},"ISBN":["9783032133007","9783032133014"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-13301-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,11]]},"assertion":[{"value":"11 December 2025","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":"Bhubaneshwar","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}