{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:10:54Z","timestamp":1765113054272,"version":"3.41.2"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031972591","type":"print"},{"value":"9783031972607","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"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-031-97260-7_18","type":"book-chapter","created":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T05:21:08Z","timestamp":1752470468000},"page":"395-413","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Simultaneously Simple Universal and\u00a0Indifferentiable Hashing to\u00a0Elliptic Curves"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4796-8989","authenticated-orcid":false,"given":"Dimitri","family":"Koshelev","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","unstructured":"Aardal, M.A., Aranha, D.F.: 2DT-GLS: faster and exception-free scalar multiplication in the GLS254 binary curve. In: Smith, B., Wu, H. (eds.) SAC 2022. LNCS, vol. 13742, pp. 53\u201374. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58411-4_3","DOI":"10.1007\/978-3-031-58411-4_3"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Aranha, D.F., Salling Hvass, B., Spitters, B., Tibouchi, M.: Faster constant-time evaluation of the Kronecker symbol with application to elliptic curve hashing. In: CCS 2023: ACM Conference on Computer and Communications Security, pp. 3228\u20133238. ACM Press, New York (2023). https:\/\/doi.org\/10.1145\/3576915.3616597","DOI":"10.1145\/3576915.3616597"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Aubry, Y., Perret, M.: A Weil theorem for singular curves. In: Pellikaan, R., Perret, M., Vl\u0103du\u0163, S.G. (eds.) Arithmetic, Geometry, and Coding Theory, pp.\u00a01\u20137. Proceedings in Mathematics. De Gruyter, Berlin (1996). https:\/\/doi.org\/10.1515\/9783110811056.1","DOI":"10.1515\/9783110811056.1"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-642-14623-7_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"E Brier","year":"2010","unstructured":"Brier, E., Coron, J.-S., Icart, T., Madore, D., Randriam, H., Tibouchi, M.: Efficient indifferentiable hashing into ordinary elliptic curves. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 237\u2013254. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_13"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Chen, L., Moody, D., Regenscheid, A., Robinson, A., Randall, K.: Recommendations for discrete logarithm-based cryptography: elliptic curve domain parameters (NIST Special Publication 800-186) (2023). https:\/\/csrc.nist.gov\/publications\/detail\/sp\/800-186\/final","DOI":"10.6028\/NIST.SP.800-186"},{"key":"18_CR6","doi-asserted-by":"publisher","unstructured":"Ch\u00e1vez-Saab, J., Rodr\u00edguez-Henr\u00edquez, F., Tibouchi, M.: SwiftEC: Shallue-van de Woestijne indifferentiable function to elliptic curves. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13791, pp. 63\u201392. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_3","DOI":"10.1007\/978-3-031-22963-3_3"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"El Mrabet, N., Joye, M. (eds.): Guide to pairing-based cryptography. Cryptography and Network Security Series. Chapman and Hall\/CRC, New York (2017). https:\/\/doi.org\/10.1201\/9781315370170","DOI":"10.1201\/9781315370170"},{"issue":"332","key":"18_CR8","doi-asserted-by":"publisher","first-page":"2997","DOI":"10.1090\/mcom\/3669","volume":"90","author":"R Granger","year":"2021","unstructured":"Granger, R., Kleinjung, T., Lenstra, A.K., Wesolowski, B., Zumbr\u00e4gel, J.: Computation of a 30750-bit binary field discrete logarithm. Math. Comput. 90(332), 2997\u20133022 (2021). https:\/\/doi.org\/10.1090\/mcom\/3669","journal-title":"Math. Comput."},{"key":"18_CR9","unstructured":"Hassett, B.: Rational surfaces over nonclosed fields. In: Darmon, H., Ellwood, D.A., Hassett, B., Tschinkel, Y. (eds.) Arithmetic Geometry. Clay Mathematics Proceedings, vol.\u00a08, pp. 155\u2013209. Clay Mathematics Institute, Cambridge (2009). https:\/\/www.math.brown.edu\/bhassett\/papers\/Claylecture\/CMIPhassett.pdf"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.laa.2019.12.012","volume":"589","author":"M Homma","year":"2020","unstructured":"Homma, M.: Fragments of plane filling curves of degree $$q + 2$$ over the finite field of $$q$$ elements, and of affine-plane filling curves of degree $$q + 1$$. Linear Algebra Appl. 589, 9\u201327 (2020). https:\/\/doi.org\/10.1016\/j.laa.2019.12.012","journal-title":"Linear Algebra Appl."},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-642-03356-8_18","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"T Icart","year":"2009","unstructured":"Icart, T.: How to hash into elliptic curves. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 303\u2013316. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_18"},{"issue":"4","key":"18_CR12","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1070\/sm1967v003n04abeh002769","volume":"3","author":"VA Iskovskikh","year":"1967","unstructured":"Iskovskikh, V.A.: Rational surfaces with a pencil of rational curves. Math. USSR-Sbornik 3(4), 563\u2013587 (1967). https:\/\/doi.org\/10.1070\/sm1967v003n04abeh002769","journal-title":"Math. USSR-Sbornik"},{"issue":"3","key":"18_CR13","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/bf00196911","volume":"3","author":"BS Kaliski Jr","year":"1991","unstructured":"Kaliski, B.S., Jr.: One-way permutations on elliptic curves. J. Cryptol. 3(3), 187\u2013199 (1991). https:\/\/doi.org\/10.1007\/bf00196911","journal-title":"J. Cryptol."},{"issue":"177","key":"18_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/s0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987). https:\/\/doi.org\/10.1090\/s0025-5718-1987-0866109-5","journal-title":"Math. Comput."},{"issue":"4","key":"18_CR15","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1353\/ajm.2017.0024","volume":"139","author":"J Koll\u00e1r","year":"2017","unstructured":"Koll\u00e1r, J., Mella, M.: Quadratic families of elliptic curves and unirationality of degree $$1$$ conic bundles. Am. J. Math. 139(4), 915\u2013936 (2017). https:\/\/doi.org\/10.1353\/ajm.2017.0024","journal-title":"Am. J. Math."},{"issue":"3","key":"18_CR16","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s10623-022-01012-8","volume":"90","author":"D Koshelev","year":"2022","unstructured":"Koshelev, D.: Indifferentiable hashing to ordinary elliptic $$\\mathbb{F} _{q}$$-curves of $$j = 0$$ with the cost of one exponentiation in $$\\mathbb{F} _{q}$$. Des. Codes Crypt. 90(3), 801\u2013812 (2022). https:\/\/doi.org\/10.1007\/s10623-022-01012-8","journal-title":"Des. Codes Crypt."},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1515\/jmc-2021-0051","volume":"16","author":"D Koshelev","year":"2022","unstructured":"Koshelev, D.: The most efficient indifferentiable hashing to elliptic curves of $$j$$-invariant $$1728$$. J. Math. Cryptol. 16(1), 298\u2013309 (2022). https:\/\/doi.org\/10.1515\/jmc-2021-0051","journal-title":"J. Math. Cryptol."},{"key":"18_CR18","doi-asserted-by":"publisher","unstructured":"Koshelev, D.: Hashing to elliptic curves through Cipolla\u2013Lehmer\u2013M\u00fcller\u2019s square root algorithm. J. Cryptol. 37(2), article 11 (2024). https:\/\/doi.org\/10.1007\/s00145-024-09490-w","DOI":"10.1007\/s00145-024-09490-w"},{"key":"18_CR19","unstructured":"Koshelev, D.: Magma code (2024). https:\/\/github.com\/Dimitri-Koshelev\/Simultaneously-simple-universal-and-indifferentiable-hashing-to-elliptic-curves"},{"issue":"4","key":"18_CR20","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s11416-024-00514-4","volume":"20","author":"D Koshelev","year":"2024","unstructured":"Koshelev, D.: Some remarks on how to hash faster onto elliptic curves. J. Comput. Virol. Hack. Tech. 20(4), 593\u2013605 (2024). https:\/\/doi.org\/10.1007\/s11416-024-00514-4","journal-title":"J. Comput. Virol. Hack. Tech."},{"key":"18_CR21","doi-asserted-by":"publisher","unstructured":"Maitin-Shepard, J., Tibouchi, M., Aranha, D.F.: Elliptic curve multiset hash. Comput. J. Sect. D: Secur. Comput. Syst. Netw. 60(4), 476\u2013490 (2017). https:\/\/doi.org\/10.1093\/comjnl\/bxw053","DOI":"10.1093\/comjnl\/bxw053"},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-24638-1_2","volume-title":"Theory of Cryptography","author":"U Maurer","year":"2004","unstructured":"Maurer, U., Renner, R., Holenstein, C.: Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 21\u201339. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_2"},{"key":"18_CR23","doi-asserted-by":"publisher","unstructured":"Menezes, A.J., Vanstone, S.A., Okamoto, T.: Reducing elliptic curve logarithms to logarithms in a finite field. In: STOC 1991: ACM Symposium on Theory of Computing, pp. 80\u201389. ACM Press, New York (1991). https:\/\/doi.org\/10.1145\/103418.103434","DOI":"10.1145\/103418.103434"},{"key":"18_CR24","unstructured":"Noether, S.: Understanding ge fromfe frombytes vartime. https:\/\/www.getmonero.org\/ru\/resources\/research-lab\/pubs\/ge_fromfe.pdf"},{"key":"18_CR25","unstructured":"Pornin, T.: Faster complete formulas for the GLS254 binary curve (2023). https:\/\/eprint.iacr.org\/2023\/1688"},{"key":"18_CR26","unstructured":"van Saberhagen, N.: CryptoNote v 2.0 (2013). https:\/\/bytecoin.org\/old\/whitepaper.pdf"},{"key":"18_CR27","doi-asserted-by":"publisher","unstructured":"Sendra, J.R., Winkler, F., P\u00e9rez-D\u00edaz, S.: Rational algebraic curves: a computer algebra approach. Algorithms Comput. Math. 22 Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-73725-4","DOI":"10.1007\/978-3-540-73725-4"},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/11792086_36","volume-title":"Algorithmic Number Theory","author":"A Shallue","year":"2006","unstructured":"Shallue, A., van de Woestijne, C.E.: Construction of rational points on elliptic curves over finite fields. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 510\u2013524. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11792086_36"},{"issue":"3","key":"18_CR29","doi-asserted-by":"publisher","first-page":"293","DOI":"10.4064\/aa117-3-7","volume":"117","author":"M Ska\u0142ba","year":"2005","unstructured":"Ska\u0142ba, M.: Points on elliptic curves over finite fields. Acta Arith 117(3), 293\u2013301 (2005). https:\/\/doi.org\/10.4064\/aa117-3-7","journal-title":"Acta Arith"},{"key":"18_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-319-12475-9_3","volume-title":"Provable Security","author":"M Tibouchi","year":"2014","unstructured":"Tibouchi, M.: Impossibility of surjective Icart-like encodings. In: Chow, S.S.M., Liu, J.K., Hui, L.C.K., Yiu, S.M. (eds.) ProvSec 2014. LNCS, vol. 8782, pp. 29\u201339. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12475-9_3"},{"key":"18_CR31","doi-asserted-by":"publisher","unstructured":"Tsfasman, M.A., Vl\u0103du\u0163, S.G., Nogin, D.Y.: Algebraic geometric codes: basic notions. In: Mathematical Surveys and Monographs, vol.\u00a0139. American Mathematical Society, Providence (2007). https:\/\/doi.org\/10.1090\/surv\/139","DOI":"10.1090\/surv\/139"},{"key":"18_CR32","doi-asserted-by":"publisher","unstructured":"Wahby, R.S., Boneh, D.: Fast and simple constant-time hashing to the BLS12-381 elliptic curve. IACR Trans. Cryptogr. Hardw. Embed. Syst. (CHES) 2019(4), 154\u2013179 (2019). https:\/\/doi.org\/10.13154\/tches.v2019.i4.154-179","DOI":"10.13154\/tches.v2019.i4.154-179"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97260-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T05:21:11Z","timestamp":1752470471000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97260-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"ISBN":["9783031972591","9783031972607"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97260-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,2]]},"assertion":[{"value":"2 July 2025","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":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","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":"21 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/africacrypt2025.sciencesconf.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}