{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T08:38:56Z","timestamp":1771576736068,"version":"3.50.1"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T00:00:00Z","timestamp":1710720000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T00:00:00Z","timestamp":1710720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100015595","name":"Ethereum Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100015595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comput Virol Hack Tech"],"DOI":"10.1007\/s11416-024-00514-4","type":"journal-article","created":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T03:01:45Z","timestamp":1710730905000},"page":"593-605","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Some remarks on how to hash faster onto elliptic curves"],"prefix":"10.1007","volume":"20","author":[{"given":"Dmitrii","family":"Koshelev","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,18]]},"reference":[{"key":"514_CR1","doi-asserted-by":"crossref","unstructured":"Ch\u00e1vez-Saab, J., Rodriguez-Henriquez, F., Tibouchi, M.: SWIFTEC: Shallue\u2013van de Woestijne indifferentiable function to elliptic curves. In: Agrawal S., Lin, D. (eds.) Advances in Cryptology\u2014ASIACRYPT 2022, LNCS, vol. 13791, pp. 63\u201392. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-22963-3_3"},{"key":"514_CR2","doi-asserted-by":"crossref","unstructured":"El Mrabet, N., Joye, M. (eds.) Guide to Pairing-Based Cryptography. Cryptography and Network Security Series. Chapman and Hall\/CRC, New York (2017)","DOI":"10.1201\/9781315370170"},{"key":"514_CR3","doi-asserted-by":"crossref","unstructured":"Faz-Hernandez, A., Scott, S., Sullivan, N., Wahby, R.S., Wood, C.A.: Hashing to elliptic curves (RFC 9380). https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-hash-to-curve (2023)","DOI":"10.17487\/RFC9380"},{"key":"514_CR4","unstructured":"Sakemi, Y., Kobayashi, T., Saito, T., Wahby, R.S.: Pairing-friendly curves. https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-pairing-friendly-curves (2023)"},{"key":"514_CR5","doi-asserted-by":"crossref","unstructured":"Budroni, A., Pintore, F.: Efficient hash maps to $$\\mathbb{G}_2$$ on BLS curves. Appl. Algebra Eng. Commun. Comput. 1\u201321 (2020)","DOI":"10.1007\/s00200-020-00453-9"},{"key":"514_CR6","doi-asserted-by":"crossref","unstructured":"El Housni, Y., Guillevic, A.: Families of SNARK-friendly 2-chains of elliptic curves. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology\u2014EUROCRYPT 2022, LNCS, vol. 13276, pp. 367\u2013396. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-07085-3_13"},{"key":"514_CR7","doi-asserted-by":"crossref","unstructured":"El Housni, Y., Guillevic, A., Piellard, T.: Co-factor clearing and subgroup membership testing on pairing-friendly curves. In: Batina, L., Daemen, J. (eds.) Progress in Cryptology\u2014AFRICACRYPT 2022, LNCS, vol. 13503, pp. 518\u2013536. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-17433-9_22"},{"key":"514_CR8","doi-asserted-by":"crossref","unstructured":"Fuentes-Castaneda, L., Knapp, E., Rodr\u00edguez-Henr\u00edquez, F.: Faster hashing to $$\\mathbb{G}_2$$. In: Miri, A., Vaudenay, S. (eds.) Selected Areas in Cryptography. SAC 2011, LNCS, vol. 7118, pp. 412\u2013430. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-28496-0_25"},{"key":"514_CR9","unstructured":"Scott M.: Authenticated ID-based key exchange and remote log-in with simple token and PIN number. https:\/\/eprint.iacr.org\/2002\/164 (2002)"},{"issue":"1","key":"514_CR10","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(1), 57\u201369 (2021)","journal-title":"J. Cryptogr. Eng."},{"key":"514_CR11","unstructured":"Boneh, D., Gorbunov, S., Wahby, R.S., Wee, H., Wood, C.A., Zhang, Z.: BLS signatures. https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-bls-signature (2022)"},{"key":"514_CR12","doi-asserted-by":"crossref","unstructured":"Boneh, D., Drijvers, M., Neven, G.: Compact multi-signatures for smaller blockchains. In: Peyrin, T., Galbraith, S.D. (eds.) Advances in Cryptology\u2014ASIACRYPT 2018 , LNCS, vol. 11273, pp. 435\u2013464. Springer, Cham (2018)","DOI":"10.1007\/978-3-030-03329-3_15"},{"key":"514_CR13","unstructured":"Boneh, D., Drijvers, M., Neven, G.: BLS multi-signatures with public-key aggregation. https:\/\/crypto.stanford.edu\/~dabo\/pubs\/papers\/BLSmultisig.html (2018)"},{"key":"514_CR14","unstructured":"Galbraith, S.D.: CRYPTREC review of EdDSA. https:\/\/www.cryptrec.go.jp\/exreport\/cryptrec-ex-3003-2020.pdf (2020)"},{"key":"514_CR15","doi-asserted-by":"crossref","unstructured":"Lim, C.H., Lee, P.J.: A key recovery attack on discrete log-based schemes using a prime order subgroup. In: Kaliski, B.S. (ed.) Advances in Cryptology\u2014CRYPTO 1997, LNCS, vol. 1294, pp. 249\u2013263. Springer, Berlin (1997)","DOI":"10.1007\/BFb0052240"},{"key":"514_CR16","doi-asserted-by":"crossref","unstructured":"Barreto, P.S.L.M., Costello, C., Misoczki, R., Naehrig, M., Pereira, G.C.C.F., Zanon, G.: Subgroup security in pairing-based cryptography. In: Lauter, K., Rodriguez-Henriquez, F. (eds.) Progress in Cryptology\u2014LATINCRYPT 2015, LNCS, vol. 9230, pp. 245\u2013265. Springer, Cham (2015)","DOI":"10.1007\/978-3-319-22174-8_14"},{"key":"514_CR17","unstructured":"Spagni, R.: https:\/\/www.getmonero.org\/2017\/05\/17\/disclosure-of-a-major-bug-in-cryptonote-based-currencies.html (2017)"},{"key":"514_CR18","doi-asserted-by":"crossref","unstructured":"Barker, E., Chen, L., Roginsky, A., Vassilev, A., Davis, R.: Recommendation for pair-wise key-establishment schemes using discrete logarithm cryptography (NIST SP 800-56A Rev. 3). https:\/\/csrc.nist.gov\/Pubs\/sp\/800\/56\/a\/r3\/Final (2018)","DOI":"10.6028\/NIST.SP.800-56Ar3"},{"issue":"10","key":"514_CR19","doi-asserted-by":"publisher","first-page":"3141","DOI":"10.1007\/s10623-023-01223-7","volume":"91","author":"Y Dai","year":"2023","unstructured":"Dai, Y., Lin, K., Zhao, C.-A., Zhou, Z.: Fast subgroup membership testings for $$\\mathbb{G} _1$$, $$\\mathbb{G} _2$$ and $$\\mathbb{G} _T$$ on pairing-friendly curves. Des. Codes Crypt. 91(10), 3141\u20133166 (2023)","journal-title":"Des. Codes Crypt."},{"key":"514_CR20","unstructured":"Granger, R., Smart, N.P.: On computing products of pairings. https:\/\/eprint.iacr.org\/2006\/172 (2006)"},{"key":"514_CR21","doi-asserted-by":"crossref","unstructured":"El Housni, Y., Guillevic, A.: Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition. In: Krenn, S., Shulman, H., Vaudenay, S. (eds.) Cryptology and Network Security. CANS 2020, LNCS, vol. 12579, pp. 259\u2013279. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-65411-5_13"},{"key":"514_CR22","unstructured":"Vlasov A.: EIP-2539: BLS12-377 curve operations. https:\/\/eips.ethereum.org\/EIPS\/eip-2539 (2020)"},{"issue":"3","key":"514_CR23","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 Cryptogr. 90(3), 801\u2013812 (2022)","journal-title":"Des Codes Cryptogr."},{"key":"514_CR24","doi-asserted-by":"crossref","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.) Advances in Cryptology\u2014CRYPTO 2010, LNCS, vol. 6223, pp. 237\u2013254. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-14623-7_13"},{"issue":"4","key":"514_CR25","doi-asserted-by":"publisher","first-page":"154","DOI":"10.46586\/tches.v2019.i4.154-179","volume":"2019","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. 2019(4), 154\u2013179 (2019)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"514_CR26","doi-asserted-by":"crossref","unstructured":"Cohen, H., Frey, G., Avanzi, R., Doche, C., Lange, T., Nguyen, K., Vercauteren, F. (eds.): Handbook of Elliptic and Hyperelliptic Curve Cryptography. Discrete Mathematics and Its Applications, vol. 34. Chapman and Hall\/CRC, New York (2005)","DOI":"10.1201\/9781420034981"},{"key":"514_CR27","unstructured":"Koshelev, D.: Magma code. https:\/\/github.com\/Dimitri-Koshelev\/Some-remarks-on-how-to-hash-faster-onto-elliptic-curves(2022)"},{"key":"514_CR28","unstructured":"Supranational: blst\/src\/sqrt-addchain.h. https:\/\/github.com\/supranational\/blst\/blob\/c76b5ac69a0044432d16cfd2cce60c93c8b01872\/src\/sqrt-addchain.h (2020)"},{"key":"514_CR29","unstructured":"Koshelev, D.: Sage code. https:\/\/github.com\/Dimitri-Koshelev\/Indifferentiable-hashing-to-ordinary-elliptic-curves-of-j-0-with-the-cost-of-one-exponentiation (2022)"},{"key":"514_CR30","unstructured":"Zhang, Z.: Rust code. https:\/\/github.com\/zhenfeizhang\/indifferentiable-hashing (2023)"},{"issue":"1\u20132","key":"514_CR31","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10623-016-0288-2","volume":"82","author":"M Tibouchi","year":"2017","unstructured":"Tibouchi, M., Kim, T.: Improved elliptic curve hashing and point representation. Des. Codes Cryptogr. 82(1\u20132), 161\u2013177 (2017)","journal-title":"Des. Codes Cryptogr."},{"issue":"281","key":"514_CR32","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1090\/S0025-5718-2012-02606-8","volume":"82","author":"RR Farashahi","year":"2013","unstructured":"Farashahi, R.R., Fouque, P.-A., Shparlinski, I.E., Tibouchi, M., Voloch, J.F.: Indifferentiable deterministic hashing to elliptic and hyperelliptic curves. Math. Comput. 82(281), 491\u2013512 (2013)","journal-title":"Math. Comput."},{"issue":"1","key":"514_CR33","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)","journal-title":"J. Math. Cryptol."},{"issue":"3","key":"514_CR34","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/MCOMSTD.121.2100005","volume":"5","author":"F Hao","year":"2021","unstructured":"Hao, F.: Prudent practices in security standardization. IEEE Commun. Stand. Mag. 5(3), 40\u201347 (2021)","journal-title":"IEEE Commun. Stand. Mag."},{"key":"514_CR35","unstructured":"Crypto Forum Research Group (CFRG): PAKE selection process. https:\/\/github.com\/cfrg\/pake-selection (2020)"},{"key":"514_CR36","unstructured":"Abdalla, M., Haase, B., Hesse, J.: CPace, a balanced composable PAKE. https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-cpace (2023)"},{"key":"514_CR37","unstructured":"Bourdrez, D., Krawczyk, H., Lewi, K., Wood, C.A.: The OPAQUE asymmetric PAKE protocol. https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-opaque (2023)"},{"key":"514_CR38","doi-asserted-by":"crossref","unstructured":"Abe, M., Okamoto, T.: Provably secure partially blind signatures. In: Bellare, M. (ed.) Advances in Cryptology\u2014CRYPTO 2000, LNCS, vol. 1880, pp. 271\u2013286. Springer, Berlin (2000)","DOI":"10.1007\/3-540-44598-6_17"},{"key":"514_CR39","doi-asserted-by":"crossref","unstructured":"Tessaro, S., Zhu, C.: Short pairing-free blind signatures with exponential security. In: Dunkelman, O., Dziembowski, S. (eds.) Cryptology\u2014EUROCRYPT 2022, LNCS, vol. 13276, pp. 782\u2013811. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-07085-3_27"},{"key":"514_CR40","doi-asserted-by":"crossref","unstructured":"Davidson, A., Faz-Hern\u00e1ndez, A., Sullivan, N., Wood, C.A.: Oblivious pseudorandom functions (OPRFs) using prime-order groups. https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-voprf (2023)","DOI":"10.17487\/RFC9497"},{"key":"514_CR41","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H.: Round-optimal password-protected secret sharing and T-PAKE in the password-only model. In: Sarkar, P., Iwata, T. (eds.) Advances in Cryptology\u2014ASIACRYPT 2014, LNCS, vol. 8874, pp. 233\u2013253. Springer, Berlin (2014)","DOI":"10.1007\/978-3-662-45608-8_13"},{"key":"514_CR42","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Kiayias, A., Krawczyk, H., Xu, J.: Highly-efficient and composable password-protected secret sharing (or: how to protect your Bitcoin wallet online). In: 2016 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 276\u2013291 (2016)","DOI":"10.1109\/EuroSP.2016.30"},{"key":"514_CR43","doi-asserted-by":"crossref","unstructured":"Icart T.: How to hash into elliptic curves. In: Halevi, S. (eds.) Advances in Cryptology\u2014CRYPTO 2009, LNCS, vol. 5677, pp. 303\u2013316. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-03356-8_18"},{"issue":"4","key":"514_CR44","first-page":"115","volume":"12","author":"D Koshelev","year":"2021","unstructured":"Koshelev, D.: Faster point compression for elliptic curves of $$j$$-invariant 0. Math. Asp. Cryptogr. 12(4), 115\u2013123 (2021)","journal-title":"Math. Asp. Cryptogr."},{"key":"514_CR45","unstructured":"Agence Nationale de la S\u00e9curit\u00e9 des Syst\u00e8mes d\u2019Information (ANSSI): Avis relatif aux param\u00e8tres de courbes elliptiques d\u00e9finis par l\u2019Etat fran\u00e7ais. https:\/\/www.legifrance.gouv.fr\/jorf\/id\/JORFTEXT000024668816 (2011)"},{"key":"514_CR46","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 SP 800-186). https:\/\/csrc.nist.gov\/publications\/detail\/sp\/800-186\/final (2023)","DOI":"10.6028\/NIST.SP.800-186"},{"issue":"3","key":"514_CR47","first-page":"5","volume":"9","author":"EK Alekseev","year":"2018","unstructured":"Alekseev, E.K., Nikolaev, V.D., Smyshlyaev, S.V.: On the security properties of Russian standardized elliptic curves. Math. Asp. Cryptogr. 9(3), 5\u201332 (2018)","journal-title":"Math. Asp. Cryptogr."},{"key":"514_CR48","doi-asserted-by":"crossref","unstructured":"Fried, M.D.: Global construction of general exceptional covers, with motivation for applications to encoding. In: Mullen, G.L., Shiue, P.J. (eds.) Finite Fields: Theory, Applications, and Algorithms. Contemporary Mathematics, vol.168, pp. 69\u2013100. American Mathematical Society, Providence (1994)","DOI":"10.1090\/conm\/168\/01690"},{"key":"514_CR49","doi-asserted-by":"crossref","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.) Provable Security. ProvSec 2014, LNCS, vol. 8782, pp. 29\u201339. Springer, Cham (2014)","DOI":"10.1007\/978-3-319-12475-9_3"},{"issue":"4","key":"514_CR50","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1137\/21M1441602","volume":"6","author":"D Koshelev","year":"2022","unstructured":"Koshelev, D.: Optimal encodings to elliptic curves of $$j$$-invariants 0, 1728. SIAM J. Appl. Algebra Geom. 6(4), 600\u2013617 (2022)","journal-title":"SIAM J. Appl. Algebra Geom."},{"key":"514_CR51","unstructured":"Levi, S. (ed.) The Eightfold Way: The Beauty of Klein\u2019s Quartic Curve. Mathematical Sciences Research Institute Publications, vol. 35. Cambridge University Press, Cambridge (1999)"},{"key":"514_CR52","unstructured":"Magma group: Automorphism groups of curves. https:\/\/magma.maths.usyd.edu.au\/magma\/handbook\/text\/1417#16052"},{"key":"514_CR53","unstructured":"Gasnier, J., Guillevic, A.: An algebraic point of view on the generation of pairing-friendly curves. https:\/\/hal.science\/hal-04205681 (2023)"},{"issue":"3","key":"514_CR54","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)","journal-title":"Acta Arith."},{"key":"514_CR55","doi-asserted-by":"crossref","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.) Algorithmic Number Theory. ANTS 2006, LNCS, vol. 4076, pp. 510\u2013524. Springer, Berlin (2006)","DOI":"10.1007\/11792086_36"},{"key":"514_CR56","doi-asserted-by":"crossref","unstructured":"Koshelev, D.: Hashing to elliptic curves through Cipolla\u2013Lehmer\u2013M\u00fcller\u2019s square root algorithm. https:\/\/eprint.iacr.org\/2023\/390 (2023)","DOI":"10.1007\/s00145-024-09490-w"},{"key":"514_CR57","unstructured":"Pornin, T.: X25519 implementation for ARM Cortex-M0\/M0+. https:\/\/github.com\/pornin\/x25519-cm0 (2020)"},{"key":"514_CR58","unstructured":"Hamburg, M.: Computing the Jacobi symbol using Bernstein\u2013Yang. https:\/\/eprint.iacr.org\/2021\/1271 (2021)"},{"key":"514_CR59","unstructured":"Moret-Bailly, L.: Vari\u00e9t\u00e9s stablement rationnelles non rationnelles, S\u00e9minaire Bourbaki: volume 1984\/85, report no. 643. Ast\u00e9risque 133\u2013134, 223\u2013236 (1986)"},{"issue":"4","key":"514_CR60","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)","journal-title":"Am. J. Math."},{"issue":"11","key":"514_CR61","doi-asserted-by":"publisher","first-page":"3333","DOI":"10.1007\/s10623-022-01135-y","volume":"91","author":"DF Aranha","year":"2023","unstructured":"Aranha, D.F., El Housni, Y., Guillevic, A.: A survey of elliptic curves for proof systems. Des. Codes Cryptogr. 91(11), 3333\u20133378 (2023)","journal-title":"Des. Codes Cryptogr."},{"key":"514_CR62","unstructured":"Bernstein, D.J.: Faster square roots in annoying finite fields. https:\/\/cr.yp.to\/papers.html#sqroot (2001)"},{"key":"514_CR63","unstructured":"Herold, G.: field_element_square_root.go. https:\/\/github.com\/GottfriedHerold\/Bandersnatch\/blob\/main\/bandersnatch\/fieldElements\/field_element_square_root.go (2023)"},{"key":"514_CR64","unstructured":"Hagopian, I.: Bandersnatch sqrt optimization notes. https:\/\/hackmd.io\/@jsign\/bandersnatch-optimized-sqrt-notes (2023)"},{"key":"514_CR65","unstructured":"Bernstein, D.J.: Cache-timing attacks on AES. https:\/\/cr.yp.to\/papers.html#cachetiming (2005)"},{"key":"514_CR66","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00145-009-9049-y","volume":"23","author":"E Tromer","year":"2010","unstructured":"Tromer, E., Osvik, D.A., Shamir, A.: Efficient cache attacks on AES, and countermeasures. J. Cryptol. 23, 37\u201371 (2010)","journal-title":"J. Cryptol."},{"issue":"3","key":"514_CR67","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1023\/B:DESI.0000015890.44831.e2","volume":"31","author":"S M\u00fcller","year":"2004","unstructured":"M\u00fcller, S.: On the computation of square roots in finite fields. Des. Codes Cryptogr. 31(3), 301\u2013312 (2004)","journal-title":"Des. Codes Cryptogr."},{"key":"514_CR68","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139012843","volume-title":"Mathematics of Public Key Cryptography","author":"SD Galbraith","year":"2012","unstructured":"Galbraith, S.D.: Mathematics of Public Key Cryptography. Cambridge University Press, New York (2012)"},{"key":"514_CR69","first-page":"223","volume":"6","author":"H Postl","year":"1988","unstructured":"Postl, H.: Fast evaluation of Dickson polynomials. Contrib. Gen. Algebra 6, 223\u2013225 (1988)","journal-title":"Contrib. Gen. Algebra"},{"issue":"6","key":"514_CR70","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1049\/el:19960359","volume":"32","author":"M Joye","year":"1996","unstructured":"Joye, M., Quisquater, J.-J.: Efficient computation of full Lucas sequences. Electron. Lett. 32(6), 537\u2013538 (1996)","journal-title":"Electron. Lett."},{"key":"514_CR71","unstructured":"Lambert, R.J.: Method to calculate square roots for elliptic curve cryptography. United States patent No. 9148282B2. https:\/\/patents.google.com\/patent\/US9148282B2\/en (2013)"},{"key":"514_CR72","unstructured":"Stark curve. https:\/\/docs.starkware.co\/starkex\/crypto\/stark-curve.html"},{"key":"514_CR73","unstructured":"Starkjub. https:\/\/github.com\/hashcloak\/starkjub (2023)"},{"key":"514_CR74","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., De Feo, L., Leroux, A., Smith, B.: Faster computation of isogenies of large prime degree. The Open Book Series 4(1), 39\u201355 (2020)","DOI":"10.2140\/obs.2020.4.39"},{"issue":"1","key":"514_CR75","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s13389-022-00293-y","volume":"13","author":"G Adj","year":"2023","unstructured":"Adj, G., Chi-Dom\u00ednguez, J.J., Rodr\u00edguez-Henr\u00edquez, F.: Karatsuba-based square-root V\u00e9lu\u2019s formulas applied to two isogeny-based protocols. J. Cryptogr. Eng. 13(1), 89\u2013106 (2023)","journal-title":"J. Cryptogr. Eng."},{"issue":"A","key":"514_CR76","first-page":"33","volume":"1","author":"H Sato","year":"2009","unstructured":"Sato, H., Hakuta, K.: An efficient method of generating rational points on elliptic curves. J. Math Ind. 1(A), 33\u201344 (2009)","journal-title":"J. Math Ind."},{"key":"514_CR77","unstructured":"Shparlinski, I.E., Voloch, J.F.: Generators of elliptic curves over finite fields. Bull. Inst. Math. Acad. Sinica (New Ser.) 9(4), 657\u2013670 (2014)"}],"container-title":["Journal of Computer Virology and Hacking Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-024-00514-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11416-024-00514-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-024-00514-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T15:08:38Z","timestamp":1729004918000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11416-024-00514-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,18]]},"references-count":77,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,11]]}},"alternative-id":["514"],"URL":"https:\/\/doi.org\/10.1007\/s11416-024-00514-4","relation":{},"ISSN":["2263-8733"],"issn-type":[{"value":"2263-8733","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,18]]},"assertion":[{"value":"14 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author states no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest."}}]}}