{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T23:56:20Z","timestamp":1772927780393,"version":"3.50.1"},"reference-count":24,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2026,3,1]]},"DOI":"10.1587\/transfun.2025cip0002","type":"journal-article","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T22:09:27Z","timestamp":1753999767000},"page":"147-155","source":"Crossref","is-referenced-by-count":0,"title":["Faster CGL Hash Function via Reduced Backtracking Checks"],"prefix":"10.1587","volume":"E109.A","author":[{"given":"Shota","family":"INOUE","sequence":"first","affiliation":[{"name":"The University of Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusuke","family":"AIKAWA","sequence":"additional","affiliation":[{"name":"The University of Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuyoshi","family":"TAKAGI","sequence":"additional","affiliation":[{"name":"The University of Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"ONUKI","sequence":"additional","affiliation":[{"name":"The University of Tokyo"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] S. Inoue, Y. Aikawa, and T. Takagi, \u201cA faster variant of CGL hash function via efficient backtracking checks,\u201d Information Security, pp.81-100, 2024. 10.1007\/978-3-031-75764-8_5","DOI":"10.1007\/978-3-031-75764-8_5"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] D.X. Charles, K.E. Lauter, and E.Z. Goren, \u201cCryptographic hash functions from expander graphs,\u201d J. Cryptol., vol.22, no.1, pp.93-113, 2009. 10.1007\/s00145-007-9002-x","DOI":"10.1007\/s00145-007-9002-x"},{"key":"3","unstructured":"[3] J.M. Couveignes, \u201cHard homogeneous spaces,\u201d Cryptology ePrint Archive, Paper 2006\/291, 2006."},{"key":"4","unstructured":"[4] A. Rostovtsev and A. Stolbunov, \u201cPublic-key cryptosystem based on isogenies,\u201d Cryptology ePrint Archive, Paper 2006\/145, 2006."},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] R. Yoshida and K. Takashima, \u201cComputing a sequence of 2-isogenies on supersingular elliptic curves,\u201d IEICE Trans. Fundamentals, vol.E96-A, no.1, pp.158-165, Jan. 2013. 10.1587\/transfun.e96.a.158","DOI":"10.1587\/transfun.E96.A.158"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] Y. Hashimoto and K. Nuida, \u201cEfficient construction of CGL hash function using legendre curves,\u201d IEICE Trans. Fundamentals, vol.E106-A, no.9, pp.1131-1140, Sept. 2023. 10.1587\/transfun.2022dmp0003","DOI":"10.1587\/transfun.2022DMP0003"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] W. Castryck, T. Decru, and F. Vercauteren, \u201cRadical isogenies,\u201d Advances in Cryptology - ASIACRYPT 2020, pp.493-519, 2020. 10.1007\/978-3-030-64834-3_17","DOI":"10.1007\/978-3-030-64834-3_17"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] W. Castryck, T. Lange, C. Martindale, L. Panny, and J. Renes, \u201cCSIDH: An efficient post-quantum commutative group action,\u201d Advances in Cryptology - ASIACRYPT 2018, pp.395-427, 2018. 10.1007\/978-3-030-03332-3_15","DOI":"10.1007\/978-3-030-03332-3_15"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] W. Castryck, T. Decru, M. Houben, and F. Vercauteren, \u201cHorizontal racewalking using radical isogenies,\u201d Advances in Cryptology - ASIACRYPT 2022, pp.67-96, 2022. 10.1007\/978-3-031-22966-4_3","DOI":"10.1007\/978-3-031-22966-4_3"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] J. Doliskani, G.C.C.F. Pereira, and P.S.L.M. Barreto, \u201cFaster cryptographic hash function from supersingular isogeny graphs,\u201d Selected Areas in Cryptography, pp.399-415, 2024. 10.1007\/978-3-031-58411-4_18","DOI":"10.1007\/978-3-031-58411-4_18"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] D. Jao and L. De Feo, \u201cTowards quantum-resistant cryptosystems from supersingular elliptic curve isogenies,\u201d Post-Quantum Cryptography, pp.19-34, 2011. 10.1007\/978-3-642-25405-5_2","DOI":"10.1007\/978-3-642-25405-5_2"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] L. De Feo, D. Jao, and J. Pl\u00f4t, \u201cTowards quantum-resistant cryptosystems from supersingular elliptic curve isogenies,\u201d Journal of Mathematical Cryptology, vol.8, no.3, pp.209-247, 2014. 10.1515\/jmc-2012-0015","DOI":"10.1515\/jmc-2012-0015"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] G.H.M. Zanon, M.A. Simplicio, G.C.C.F. Pereira, J. Doliskani, and P.S.L.M. Barreto, \u201cFaster isogeny-based compressed key agreement,\u201d Post-Quantum Cryptography, pp.248-268, 2018. 10.1007\/978-3-319-79063-3_12","DOI":"10.1007\/978-3-319-79063-3_12"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] J. Renes, \u201cComputing isogenies between montgomery curves using the action of (0, 0),\u201d Post-Quantum Cryptography, pp.229-247, 2018. 10.1007\/978-3-319-79063-3_11","DOI":"10.1007\/978-3-319-79063-3_11"},{"key":"15","unstructured":"[15] L.C. Washington, Elliptic Curves: Number Theory and Cryptography, 2nd ed., Chapman &amp; Hall\/CRC, 2008. 10.1201\/9781420071474"},{"key":"16","unstructured":"[16] J.H. Silverman, The Arithmetic of Elliptic Curves, 2nd ed., Springer New York, NY, 2009. 10.1007\/978-0-387-09494-6"},{"key":"17","unstructured":"[17] J. V\u00e9lu, \u201cIsogenies entre courbes elliptiques,\u201d Compets-Rendus de l\u2019Academie des Sciences, vol.Serie I, pp.273:238-241, 1971."},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] P.L. Montgomery, \u201cSpeeding the Pollard and elliptic curve methods of factorization,\u201d Math. Comp., vol.48, no.177, pp.243-264, 1987. 10.2307\/2007888","DOI":"10.2307\/2007888"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] C. Costello, P. Longa, and M. Naehrig, \u201cEfficient algorithms for supersingular isogeny Diffie-Hellman,\u201d Advances in Cryptology - CRYPTO 2016, pp.572-601, 2016. 10.1007\/978-3-662-53018-4_21","DOI":"10.1007\/978-3-662-53018-4_21"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] G. Pereira, J. Doliskani, and D. Jao, \u201cx-only point addition formula and faster compressed SIKE,\u201d J. Cryptogr. Eng., vol.11, pp.57-69, 2021. 10.1007\/s13389-020-00245-4","DOI":"10.1007\/s13389-020-00245-4"},{"key":"21","unstructured":"[21] D. Husem\u00f6ller, Elliptic Curves, 2nd ed., Springer, 2004. 10.1007\/b97292"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] M. Corte-Real Santos, J.K. Eriksen, M. Meyer, and K. Reijnders, \u201cApr\u00e8sSQI: Extra fast verification for sqisign using extension-field signing,\u201d Advances in Cryptology - EUROCRYPT 2024, pp.63-93, 2024. 10.1007\/978-3-031-58716-0_3","DOI":"10.1007\/978-3-031-58716-0_3"},{"key":"23","unstructured":"[23] J. Maddock and C. Kormanyos, \u201cBoost Multiprecision Library.\u201d"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] G. Adj and F. Rodr\u00edguez-Henr\u00edquez, \u201cSquare root computation over even extension fields,\u201d IEEE Trans. Comput., vol.63, no.11, pp.2829-2841, 2014. 10.1109\/tc.2013.145","DOI":"10.1109\/TC.2013.145"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E109.A\/3\/E109.A_2025CIP0002\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T04:10:56Z","timestamp":1772856656000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E109.A\/3\/E109.A_2025CIP0002\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,1]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2025cip0002","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,1]]},"article-number":"2025CIP0002"}}