{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:17:32Z","timestamp":1772893052022,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031757631","type":"print"},{"value":"9783031757648","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T00:00:00Z","timestamp":1729123200000},"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-031-75764-8_5","type":"book-chapter","created":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T11:03:12Z","timestamp":1729594992000},"page":"81-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Faster Variant of\u00a0CGL Hash Function via\u00a0Efficient Backtracking Checks"],"prefix":"10.1007","author":[{"given":"Shota","family":"Inoue","sequence":"first","affiliation":[]},{"given":"Yusuke","family":"Aikawa","sequence":"additional","affiliation":[]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,17]]},"reference":[{"issue":"11","key":"5_CR1","doi-asserted-by":"publisher","first-page":"2829","DOI":"10.1109\/TC.2013.145","volume":"63","author":"G Adj","year":"2014","unstructured":"Adj, G., Rodr\u00edguez-Henr\u00edquez, F.: Square root computation over even extension fields. IEEE Trans. Comput. 63(11), 2829\u20132841 (2014). https:\/\/doi.org\/10.1109\/TC.2013.145","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1080\/10586458.2021.1926009","volume":"32","author":"S Arpin","year":"2021","unstructured":"Arpin, S., Camacho-Navarro, C., Lauter, K., Lim, J., Nelson, K., Scholl, T.: Adventures in supersingularland. Exp. Math. 32(2), 241\u2013268 (2021). https:\/\/doi.org\/10.1080\/10586458.2021.1926009","journal-title":"Exp. Math."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-031-30589-4_15","volume-title":"Advances in Cryptology - EUROCRYPT 2023","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"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-031-22966-4_3","volume-title":"Advances in Cryptology - ASIACRYPT 2022","author":"W Castryck","year":"2022","unstructured":"Castryck, W., Decru, T., Houben, M., Vercauteren, F.: Horizontal racewalking using radical isogenies. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13792, pp. 67\u201396. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_3"},{"key":"5_CR5","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"},{"key":"5_CR6","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"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00145-007-9002-x","volume":"22","author":"DX Charles","year":"2009","unstructured":"Charles, D.X., Lauter, K.E., Goren, E.Z.: Cryptographic hash functions from expander graphs. J. Crypt. 22(1), 93\u2013113 (2009). https:\/\/doi.org\/10.1007\/s00145-007-9002-x","journal-title":"J. Crypt."},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-662-53018-4_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"C Costello","year":"2016","unstructured":"Costello, C., Longa, P., Naehrig, M.: Efficient algorithms for supersingular isogeny Diffie-Hellman. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 572\u2013601. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_21"},{"key":"5_CR9","unstructured":"Couveignes, J.M.: Hard homogeneous spaces. Cryptology ePrint Archive, Paper 2006\/291 (2006). https:\/\/eprint.iacr.org\/2006\/291"},{"issue":"3","key":"5_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1515\/jmc-2012-0015","volume":"8","author":"L De Feo","year":"2014","unstructured":"De Feo, L., Jao, D., Pl\u00fbt, J.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. J. Math. Cryptol. 8(3), 209\u2013247 (2014). https:\/\/doi.org\/10.1515\/jmc-2012-0015","journal-title":"J. Math. Cryptol."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-031-58411-4_18","volume-title":"Selected Areas in Cryptography","author":"J Doliskani","year":"2024","unstructured":"Doliskani, J., Pereira, G.C.C.F., Barreto, P.S.L.M.: Faster cryptographic hash function from supersingular isogeny graphs. In: Smith, B., Wu, H. (eds.) SAC 2022. LNCS, vol. 13742, pp. 399\u2013415. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58411-4_18"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Hashimoto, Y., Nuida, K.: Efficient construction of CGL hash function using Legendre curves. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E106.A(9), 1131\u20131140 (2023). https:\/\/doi.org\/10.1587\/transfun.2022DMP0003","DOI":"10.1587\/transfun.2022DMP0003"},{"key":"5_CR13","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":"5_CR14","unstructured":"Maddock, J., Kormanyos, C.: Boost multiprecision library. https:\/\/github.com\/boostorg\/multiprecision"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-031-30589-4_16","volume-title":"Advances in Cryptology - EUROCRYPT 2023","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":"5_CR16","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"PL Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Math. Comput. 48, 243\u2013264 (1987). https:\/\/doi.org\/10.1090\/S0025-5718-1987-0866113-7","journal-title":"Math. Comput."},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s13389-020-00245-4","volume":"11","author":"G Pereira","year":"2021","unstructured":"Pereira, G., Doliskani, J., Jao, D.: X-only point addition formula and faster compressed SIKE. J. Cryptogr. Eng. 11, 57\u201369 (2021). https:\/\/doi.org\/10.1007\/s13389-020-00245-4","journal-title":"J. Cryptogr. Eng."},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Pizer, A.K.: Ramanujan graphs and Hecke operators. Bull. (New Series) Am. Math. Soc. 23(1), 127\u2013137 (1990). https:\/\/doi.org\/10.1090\/S0273-0979-1990-15918-X","DOI":"10.1090\/S0273-0979-1990-15918-X"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1090\/amsip\/007\/08","volume":"7","author":"AK Pizer","year":"1998","unstructured":"Pizer, A.K.: Ramanujan graphs. AMS\/IP Stud. Adv. Math. 7, 159\u2013178 (1998)","journal-title":"AMS\/IP Stud. Adv. Math."},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Pollard, J.: Monte Carlo methods for index compuation mod p. Math. Comput. 32(143), 918\u2013924 (1978). https:\/\/doi.org\/10.2307\/2006496","DOI":"10.2307\/2006496"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-031-30589-4_17","volume-title":"Advances in Cryptology - EUROCRYPT 2023","author":"D Robert","year":"2023","unstructured":"Robert, D.: Breaking SIDH in polynomial time. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14008, pp. 472\u2013503. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30589-4_17"},{"key":"5_CR22","unstructured":"Rostovtsev, A., Stolbunov, A.: Public-key cryptosystem based on isogenies. Cryptology ePrint Archive, Paper 2006\/145 (2006). https:\/\/eprint.iacr.org\/2006\/145"},{"key":"5_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09494-6","volume-title":"The Arithmetic of Elliptic Curves","author":"JH Silverman","year":"2009","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves, 2nd edn. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-09494-6","edition":"2"},{"key":"5_CR24","first-page":"238","volume":"273","author":"J V\u00e9lu","year":"1971","unstructured":"V\u00e9lu, J.: Isogenies entre courbes elliptiques. Compets-Rendus de l\u2019Academie des Sciences Serie I 273, 238\u2013241 (1971)","journal-title":"Compets-Rendus de l\u2019Academie des Sciences Serie I"},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Washington, L.C.: Elliptic Curves: Number Theory and Cryptography, 2nd edn. Chapman & Hall\/CRC (2008). https:\/\/doi.org\/10.1201\/9781420071474","DOI":"10.1201\/9781420071474"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Yoshida, R., Takashima, K.: Computing a sequence of 2-isogenies on supersingular elliptic curves. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E96.A(1), 158\u2013165 (2013). https:\/\/doi.org\/10.1587\/transfun.E96.A.158","DOI":"10.1587\/transfun.E96.A.158"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-319-79063-3_12","volume-title":"Post-Quantum Cryptography","author":"GHM Zanon","year":"2018","unstructured":"Zanon, G.H.M., Simplicio, M.A., Pereira, G.C.C.F., Doliskani, J., Barreto, P.S.L.M.: Faster isogeny-based compressed key agreement. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 248\u2013268. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_12"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75764-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T11:06:16Z","timestamp":1729595176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75764-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,17]]},"ISBN":["9783031757631","9783031757648"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75764-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,17]]},"assertion":[{"value":"17 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Arlington, VA","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isw2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isc24.cs.gmu.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}