{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T12:48:36Z","timestamp":1749473316015,"version":"3.41.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T00:00:00Z","timestamp":1696377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T00:00:00Z","timestamp":1696377600000},"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":["AAECC"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s00200-023-00625-3","type":"journal-article","created":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T04:01:36Z","timestamp":1696392096000},"page":"611-629","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Batch point compression in the context of advanced pairing-based protocols"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4796-8989","authenticated-orcid":false,"given":"Dmitrii","family":"Koshelev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,4]]},"reference":[{"key":"625_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-030-88238-9_16","volume-title":"Progress in Cryptology - LATINCRYPT 2021","author":"DF Aranha","year":"2021","unstructured":"Aranha, D.F., Pagnin, E., Rodr\u00edguez-Henr\u00edquez, F.: LOVE a pairing. In: Longa, P., R\u00e0fols, C. (eds.) Progress in Cryptology - LATINCRYPT 2021. Lecture Notes in Computer Science, vol. 12912, pp. 320\u2013340. Springer, Cham (2021)"},{"key":"625_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-662-44381-1_16","volume-title":"Advances in Cryptology - CRYPTO 2014","author":"E Ben-Sasson","year":"2014","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Scalable zero knowledge via cycles of elliptic curves. In: Garay, J.A., Gennaro, R. (eds.) Advances in Cryptology - CRYPTO 2014. Lecture Notes in Computer Science, vol. 8617, pp. 276\u2013294. Springer, Berlin, Heidelberg (2014)"},{"issue":"3","key":"625_CR3","doi-asserted-by":"publisher","first-page":"340","DOI":"10.46586\/tches.v2019.i3.340-398","volume":"2019","author":"DJ Bernstein","year":"2019","unstructured":"Bernstein, D.J., Yang, B.Y.: Fast constant-time GCD computation and modular inversion. IACR Trans. Cryptogr. Hardware Embedd. Syst. 2019(3), 340\u2013398 (2019)","journal-title":"IACR Trans. Cryptogr. Hardware Embedd. Syst."},{"issue":"2","key":"625_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s13389-012-0027-1","volume":"2","author":"DJ Bernstein","year":"2012","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.Y.: High-speed high-security signatures. J. Cryptogr. Eng. 2(2), 77\u201389 (2012)","journal-title":"J. Cryptogr. Eng."},{"key":"625_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D., Goh, E.J., Nissim, K.: Evaluating $$2$$-DNF formulas on ciphertexts. In: Kilian, J. (ed.) Theory of Cryptography. TCC 2005. Lecture Notes in Computer Science, vol.\u00a03378, pp. 325\u2013341. Springer, Berlin, Heidelberg (2005)","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"625_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/11761679_34","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"D Boneh","year":"2006","unstructured":"Boneh, D., Sahai, A., Waters, B.: Fully collusion resistant traitor tracing with short ciphertexts and private keys. In: Vaudenay, S. (ed.) Advances in Cryptology - EUROCRYPT 2006. Lecture Notes in Computer Science, vol. 4004, pp. 573\u2013592. Springer, Berlin, Heidelberg (2006)"},{"issue":"3","key":"625_CR7","doi-asserted-by":"publisher","first-page":"504","DOI":"10.46586\/tches.v2023.i3.504-521","volume":"2023","author":"G Botrel","year":"2023","unstructured":"Botrel, G., El Housni, Y.: Faster Montgomery multiplication and multi-scalar-multiplication for SNARKs. IACR Trans. Cryptogr. Hardware Embedd. Syst. (TCHES) 2023(3), 504\u2013521 (2023)","journal-title":"IACR Trans. Cryptogr. Hardware Embedd. Syst. (TCHES)"},{"issue":"3","key":"625_CR8","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. Rev. Roumaine Math. Pures Appl. 60(3), 337\u2013353 (2015)","journal-title":"Rev. Roumaine Math. Pures Appl."},{"key":"625_CR9","doi-asserted-by":"crossref","unstructured":"Chatterjee, S., Hankerson, D., Menezes, A.: On the efficiency and security of pairing-based protocols in the type $$1$$ and type $$4$$ settings. In: Hasan, M.A., Helleseth, T. (eds.) Arithmetic of Finite Fields. WAIFI 2010. Lecture Notes in Computer Science, vol.\u00a06087, pp. 114\u2013134. Springer, Berlin, Heidelberg (2010)","DOI":"10.1007\/978-3-642-13797-6_9"},{"key":"625_CR10","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. Lecture Notes in Computer Science, vol. 12579, pp. 259\u2013279. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-65411-5_13"},{"key":"625_CR11","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":"625_CR12","unstructured":"Ethereum Foundation: ethereum\/kzg-ceremony (2022), https:\/\/github.com\/ethereum\/kzg-ceremony"},{"issue":"3","key":"625_CR13","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-016-0251-2","volume":"83","author":"X Fan","year":"2017","unstructured":"Fan, X., Otemissov, A., Sica, F., Sidorenko, A.: Multiple point compression on elliptic curves. Des. Codes Crypt. 83(3), 565\u2013588 (2017)","journal-title":"Des. Codes Crypt."},{"key":"625_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-13190-5_3","volume-title":"Advances in Cryptology - EUROCRYPT 2010","author":"DM Freeman","year":"2010","unstructured":"Freeman, D.M.: Converting pairing-based cryptosystems from composite-order groups to prime-order groups. In: Gilbert, H. (ed.) Advances in Cryptology - EUROCRYPT 2010. Lecture Notes in Computer Science, vol. 6110, pp. 44\u201361. Springer, Berlin, Heidelberg (2010)"},{"key":"625_CR15","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":"625_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"Advances in Cryptology - EUROCRYPT 2016","author":"J Groth","year":"2016","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.S. (eds.) Advances in Cryptology - EUROCRYPT 2016. Lecture Notes in Computer Science, vol. 9665, pp. 305\u2013326. Springer, Berlin, Heidelberg (2016)"},{"key":"625_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-78967-3_24","volume-title":"Advances in Cryptology - EUROCRYPT 2008","author":"J Groth","year":"2008","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N. (ed.) Advances in Cryptology - EUROCRYPT 2008. Lecture Notes in Computer Science, vol. 4965, pp. 415\u2013432. Springer, Berlin, Heidelberg (2008)"},{"key":"625_CR18","doi-asserted-by":"crossref","unstructured":"Guillevic, A.: Comparing the pairing efficiency over composite-order and prime-order elliptic curves. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) Applied Cryptography and Network Security. ACNS 2013. Lecture Notes in Computer Science, vol.\u00a07954, pp. 357\u2013372. Springer, Berlin, Heidelberg (2013)","DOI":"10.1007\/978-3-642-38980-1_22"},{"key":"625_CR19","unstructured":"Hartshorne, R.: Algebraic Geometry, Graduate Texts in Mathematics, vol.\u00a052. Springer, New York, 8 edition (1997)"},{"key":"625_CR20","unstructured":"Hopwood, D.: Pluto\/Eris supporting evidence (2021), https:\/\/github.com\/daira\/pluto-eris"},{"key":"625_CR21","unstructured":"Hopwood, D.: The pasta curves for Halo $$2$$ and beyond (2020), https:\/\/electriccoin.co\/blog\/the-pasta-curves-for-halo-2-and-beyond"},{"issue":"1","key":"625_CR22","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1515\/jmc-2020-0077","volume":"15","author":"M Joye","year":"2021","unstructured":"Joye, M., Lapiha, O., Nguyen, K., Naccache, D.: The eleventh power residue symbol. J. Math. Cryptol. 15(1), 111\u2013122 (2021)","journal-title":"J. Math. Cryptol."},{"key":"625_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) Advances in Cryptology - ASIACRYPT 2010. Lecture Notes in Computer Science, vol. 6477, pp. 177\u2013194. Springer, Berlin, Heidelberg (2010)"},{"issue":"3","key":"625_CR24","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TC.2007.47","volume":"56","author":"M Khabbazian","year":"2007","unstructured":"Khabbazian, M., Gulliver, T.A., Bhargava, V.K.: Double point compression with applications to speeding up random point multiplication. IEEE Trans. Comput. 56(3), 305\u2013313 (2007)","journal-title":"IEEE Trans. Comput."},{"key":"625_CR25","unstructured":"Koshelev, D.: Generation of \u201cindependent\u201d points on elliptic curves by means of Mordell\u2013Weil lattices (2022), https:\/\/eprint.iacr.org\/2022\/794"},{"key":"625_CR26","unstructured":"Koshelev, D.: Generation of two \u201cindependent\u201d points on an elliptic curve of $$j$$-invariant $$\\ne 0, 1728$$ (2023), https:\/\/eprint.iacr.org\/2023\/785"},{"key":"625_CR27","doi-asserted-by":"crossref","unstructured":"Koshelev, D.: Magma code (2022), https:\/\/github.com\/dishport\/Batch-point-compression-in-the-context-of-advanced-pairing-based-protocols","DOI":"10.1007\/s00200-023-00625-3"},{"key":"625_CR28","unstructured":"Koshelev, D.: Some remarks on how to hash faster onto elliptic curves (2021), https:\/\/eprint.iacr.org\/2021\/1082"},{"issue":"4","key":"625_CR29","first-page":"115","volume":"12","author":"D Koshelev","year":"2021","unstructured":"Koshelev, D.: Faster point compression for elliptic curves of $$j$$-invariant $$0$$. Math. Aspects Cryptogr. 12(4), 115\u2013123 (2021)","journal-title":"Math. Aspects Cryptogr."},{"key":"625_CR30","doi-asserted-by":"publisher","first-page":"101774","DOI":"10.1016\/j.ffa.2020.101774","volume":"69","author":"D Koshelev","year":"2021","unstructured":"Koshelev, D.: New point compression method for elliptic $$\\mathbb{F} _{\\!q^2}$$-curves of $$j$$-invariant $$0$$. Finite Fields Appl. 69, 101774 (2021)","journal-title":"Finite Fields Appl."},{"issue":"3","key":"625_CR31","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)","journal-title":"Des. Codes Crypt."},{"key":"625_CR32","volume-title":"Algebra, Graduate Texts in Mathematics,","author":"S Lang","year":"2002","unstructured":"Lang, S.: Algebra, Graduate Texts in Mathematics, vol. 211, 3rd edn. Springer, New York (2002)","edition":"3"},{"issue":"3","key":"625_CR33","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 Crypt. 31(3), 301\u2013312 (2004)","journal-title":"Des. Codes Crypt."},{"key":"625_CR34","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":"625_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO 1991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) Advances in Cryptology - CRYPTO 1991. Lecture Notes in Computer Science, vol. 576, pp. 129\u2013140. Springer, Berlin, Heidelberg (1992)"},{"key":"625_CR36","unstructured":"Pornin, T.: Optimized binary GCD for modular inversion (2020), https:\/\/eprint.iacr.org\/2020\/972"},{"issue":"5","key":"625_CR37","doi-asserted-by":"publisher","first-page":"1401","DOI":"10.1137\/060676155","volume":"37","author":"K Rubin","year":"2008","unstructured":"Rubin, K., Silverberg, A.: Compression in finite fields and torus-based cryptography. SIAM J. Comput. 37(5), 1401\u20131428 (2008)","journal-title":"SIAM J. Comput."},{"key":"625_CR38","unstructured":"Sakemi, Y., Kobayashi, T., Saito, T., Wahby, R.S.: Pairing-friendly curves (2022), https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-pairing-friendly-curves"},{"issue":"3","key":"625_CR39","first-page":"277","volume":"27","author":"K Ueno","year":"1973","unstructured":"Ueno, K.: Classification of algebraic varieties. I. Compos. Math. 27(3), 277\u2013342 (1973)","journal-title":"I. Compos. Math."},{"issue":"4","key":"625_CR40","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. Hardware Embedd. Syst. 2019(4), 154\u2013179 (2019)","journal-title":"IACR Trans. Cryptogr. Hardware Embedd. Syst."},{"key":"625_CR41","unstructured":"ZPRIZE competition (2022), https:\/\/www.zprize.io"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-023-00625-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-023-00625-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-023-00625-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T12:24:27Z","timestamp":1749471867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-023-00625-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,4]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["625"],"URL":"https:\/\/doi.org\/10.1007\/s00200-023-00625-3","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"type":"print","value":"0938-1279"},{"type":"electronic","value":"1432-0622"}],"subject":[],"published":{"date-parts":[[2023,10,4]]},"assertion":[{"value":"27 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}