{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:52:08Z","timestamp":1769316728046,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10623-022-01012-8","type":"journal-article","created":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T17:39:01Z","timestamp":1643737141000},"page":"801-812","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Indifferentiable hashing to ordinary elliptic $${\\mathbb {F}}_{\\!q}$$-curves of $$j=0$$ with the cost of one exponentiation in $${\\mathbb {F}}_{\\!q}$$"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4796-8989","authenticated-orcid":false,"given":"Dmitrii","family":"Koshelev","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,1]]},"reference":[{"key":"1012_CR1","doi-asserted-by":"crossref","unstructured":"Bernstein D.J., Hamburg M., Krasnova A., Lange T.: Elligator: elliptic-curve points indistinguishable from uniform random strings. In: ACM SIGSAC Conference on Computer & Communications Security, pp. 967\u2013980 (2013).","DOI":"10.1145\/2508859.2516734"},{"key":"1012_CR2","doi-asserted-by":"crossref","unstructured":"Boneh D., Gentry C., Lynn B., Shacham H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham E (ed.) Advances in Cryptology\u2014EUROCRYPT 2003, LNCS, 2656, pp. 416\u2013432. Springer, Berlin (2003).","DOI":"10.1007\/3-540-39200-9_26"},{"key":"1012_CR3","unstructured":"Boneh D. et al.: BLS signatures, https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-bls-signature (2020)."},{"key":"1012_CR4","doi-asserted-by":"crossref","unstructured":"Brier E., et al.: Efficient indifferentiable hashing into ordinary elliptic curves. In: Rabin T. (ed) Advances in Cryptology\u2014CRYPTO 2010, LNCS, 6223, pp. 237\u2013254. Springer, Berlin (2010).","DOI":"10.1007\/978-3-642-14623-7_13"},{"issue":"3","key":"1012_CR5","first-page":"337","volume":"60","author":"F Catanese","year":"2015","unstructured":"Catanese F., Oguiso K., Verra A.: On the unirationality of higher dimensional Ueno-type manifolds. Revue Roumaine de Math\u00e9matiques Pures et Appliqu\u00e9es 60(3), 337\u2013353 (2015).","journal-title":"Revue Roumaine de Math\u00e9matiques Pures et Appliqu\u00e9es"},{"issue":"3","key":"1012_CR6","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10623-013-9910-8","volume":"75","author":"GH Cho","year":"2015","unstructured":"Cho G.H., Koo N., Ha E., Kwon S.: New cube root algorithm based on the third order linear recurrence relations in finite fields. Des. Codes Cryptogr. 75(3), 483\u2013495 (2015).","journal-title":"Des. Codes Cryptogr."},{"key":"1012_CR7","doi-asserted-by":"crossref","unstructured":"Dudeanu A., Oancea G.-R., Iftene S.: An x-coordinate point compression method for elliptic curves over Fp. In: 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 65\u201371 (2010).","DOI":"10.1109\/SYNASC.2010.23"},{"key":"1012_CR8","doi-asserted-by":"publisher","DOI":"10.1201\/9781315370170","volume-title":"Guide to Pairing-Based Cryptography. Cryptography and Network Security Series","author":"N El Mrabet","year":"2017","unstructured":"El Mrabet N., Joye M.: Guide to Pairing-Based Cryptography. Cryptography and Network Security Series. Chapman and Hall\/CRC, New York (2017)."},{"key":"1012_CR9","unstructured":"Faz-Hernandez A. et al.: Hashing to elliptic curves, https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-hash-to-curve\/ (2021)."},{"issue":"3","key":"1012_CR10","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.5802\/aif.2637","volume":"61","author":"K Hulek","year":"2011","unstructured":"Hulek K., Kloosterman R.: Calculating the Mordell-Weil rank of elliptic threefolds and the cohomology of singular hypersurfaces. Ann. l\u2019Institut Fourier 61(3), 1133\u20131179 (2011).","journal-title":"Ann. l\u2019Institut Fourier"},{"key":"1012_CR11","doi-asserted-by":"crossref","unstructured":"Icart T.: How to hash into elliptic curves. In: Halevi S. (ed.) Advances in Cryptology\u2014CRYPTO 2009, LNCS, 5677, pp. 303\u2013316. Springer, Berlin (2009).","DOI":"10.1007\/978-3-642-03356-8_18"},{"key":"1012_CR12","unstructured":"Koshelev D.: Efficient indifferentiable hashing to elliptic curves $$y^2 = x^3 + b$$ provided that $$b$$ is a quadratic residue. ePrint IACR (2020\/1070)."},{"key":"1012_CR13","unstructured":"Koshelev D.: Magma code, https:\/\/github.com\/dishport\/Indifferentiable-hashing-to-ordinary-elliptic-curves-of-j-0-with-the-cost-of-one-exponentiation (2021)."},{"key":"1012_CR14","first-page":"361","volume":"22","author":"K Oguiso","year":"2015","unstructured":"Oguiso K., Truong T.T.: Explicit examples of rational and Calabi-Yau threefolds with primitive automorphisms of positive entropy. J. Math. Sci. Univ. Tokyo 22, 361\u2013385 (2015).","journal-title":"J. Math. Sci. Univ. Tokyo"},{"key":"1012_CR15","unstructured":"Sakemi Y., Kobayashi T., Saito T., Wahby R. S.: Pairing-friendly curves, https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-pairing-friendly-curves (2021)."},{"key":"1012_CR16","unstructured":"Sarkar P.: Computing square roots faster than the Tonelli\u2013Shanks\/Bernstein algorithm. ePrint IACR (2020\/1407)."},{"key":"1012_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-32-9301-4","volume-title":"Mordell-Weil Lattices, A Series of Modern Surveys in Mathematics","author":"M Sch\u00fctt","year":"2019","unstructured":"Sch\u00fctt M., Shioda T.: Mordell-Weil Lattices, A Series of Modern Surveys in Mathematics, vol. 70. Springer, Singapore (2019)."},{"key":"1012_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09494-6","volume-title":"The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics","author":"J Silverman","year":"2009","unstructured":"Silverman J.: The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics, vol. 106. Springer, New York (2009)."},{"issue":"3","key":"1012_CR19","doi-asserted-by":"publisher","first-page":"293","DOI":"10.4064\/aa117-3-7","volume":"117","author":"M Skalba","year":"2005","unstructured":"Skalba M.: Points on elliptic curves over finite fields. Acta Arithmetica 117(3), 293\u2013301 (2005).","journal-title":"Acta Arithmetica"},{"key":"1012_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-76878-4","volume-title":"Algebraic Function Fields and Codes, Graduate Texts in Mathematics","author":"H Stichtenoth","year":"2009","unstructured":"Stichtenoth H.: Algebraic Function Fields and Codes, Graduate Texts in Mathematics, vol. 254. Springer, Berlin (2009)."},{"key":"1012_CR21","unstructured":"Vlasov A.: EIP-2539: BLS12-377 curve operations https:\/\/eips.ethereum.org\/EIPS\/eip-2539 (2020)."},{"key":"1012_CR22","doi-asserted-by":"publisher","first-page":"154","DOI":"10.46586\/tches.v2019.i4.154-179","volume":"4","author":"RS Wahby","year":"2019","unstructured":"Wahby R.S., Boneh D.: Fast and simple constant-time hashing to the BLS12-381 elliptic curve. IACR Trans. Cryptogr. Hardw. Embed. Syst. 4, 154\u2013179 (2019).","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01012-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01012-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01012-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T13:34:23Z","timestamp":1674653663000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01012-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,1]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1012"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01012-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,1]]},"assertion":[{"value":"13 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}