{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T12:28:41Z","timestamp":1769516921193,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":53,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819608874","type":"print"},{"value":"9789819608881","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T00:00:00Z","timestamp":1733875200000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-0888-1_15","type":"book-chapter","created":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T09:13:34Z","timestamp":1733822014000},"page":"454-485","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Revisiting Pairing-Friendly Curves with\u00a0Embedding Degrees 10 and\u00a014"],"prefix":"10.1007","author":[{"given":"Yu","family":"Dai","sequence":"first","affiliation":[]},{"given":"Debiao","family":"He","sequence":"additional","affiliation":[]},{"given":"Cong","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Zhijian","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Chang-an","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,11]]},"reference":[{"key":"15_CR1","unstructured":"European union agency of network and information security (ENISA): Algorithms, key sizes and parameters report. https:\/\/www.enisa.europa.eu\/publications\/algorithms-key-sizes-and-parameters-report (2013)"},{"key":"15_CR2","unstructured":"Aranha, D.F., Gouv\u00eaa, C.P.L.: RELIC is an Efficient LIbrary for Cryptography, https:\/\/github.com\/relic-toolkit\/relic"},{"key":"15_CR3","doi-asserted-by":"publisher","unstructured":"Aranha, D.F., El\u00a0Housni, Y., Guillevic, A.: A survey of elliptic curves for proof systems. Designs, Codes and Cryptography 91(11), 3333\u20133378 (Nov 2023). https:\/\/doi.org\/10.1007\/s10623-022-01135-y","DOI":"10.1007\/s10623-022-01135-y"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-36334-4_11","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2012","author":"DF Aranha","year":"2013","unstructured":"Aranha, D.F., Fuentes-Casta\u00f1eda, L., Knapp, E., Menezes, A., Rodr\u00edguez-Henr\u00edquez, F.: Implementing pairings at the 192-bit security level. In: Abdalla, M., Lange, T. (eds.) Pairing-Based Cryptography \u2013 Pairing 2012. pp. 177\u2013195. Springer Berlin Heidelberg, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36334-4_11"},{"key":"15_CR5","doi-asserted-by":"publisher","unstructured":"Aranha, D.F., Hvass, B.S., Spitters, B., Tibouchi, M.: Faster constant-time evaluation of the kronecker symbol with application to elliptic curve hashing. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security. p. 3228-238. CCS \u201923, Association for Computing Machinery, New York, NY, USA (2023).https:\/\/doi.org\/10.1145\/3576915.3616597","DOI":"10.1145\/3576915.3616597"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-20465-4_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"DF Aranha","year":"2011","unstructured":"Aranha, D.F., Karabina, K., Longa, P., Gebotys, C.H., L\u00f3pez, J.: Faster explicit formulas for computing pairings over ordinary curves. In: Paterson, K.G. (ed.) Advances in Cryptology \u2013 EUROCRYPT 2011. pp. 48\u201368. Springer Berlin Heidelberg, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_5"},{"issue":"6","key":"15_CR7","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1109\/TDSC.2015.2507120","volume":"14","author":"R Azarderakhsh","year":"2017","unstructured":"Azarderakhsh, R., Fishbein, D., Grewal, G., Hu, S., Jao, D., Longa, P., Verma, R.: Fast software implementations of bilinear pairings. IEEE Transactions on Dependable and Secure Computing 14(6), 605\u2013619 (2017). https:\/\/doi.org\/10.1109\/TDSC.2015.2507120","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1007\/s00145-018-9280-5","volume":"32","author":"R Barbulescu","year":"2018","unstructured":"Barbulescu, R., Duquesne, S.: Updating key size estimations for pairings. Journal of Cryptology 32(4), 1298\u20131336 (2019). https:\/\/doi.org\/10.1007\/s00145-018-9280-5","journal-title":"Journal of Cryptology"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Barbulescu, R., Gaudry, P., Kleinjung, T.: The tower number field sieve. In: Iwata, T., Cheon, J.H. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2015. pp. 31\u201355. Springer Berlin Heidelberg, Berlin, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_2","DOI":"10.1007\/978-3-662-48800-3_2"},{"key":"15_CR10","doi-asserted-by":"publisher","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., Rodr\u00edguez-Henr\u00edquez, F. (eds.) Progress in Cryptology \u2013 LATINCRYPT 2015. pp. 245\u2013265. Springer International Publishing, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22174-8_14","DOI":"10.1007\/978-3-319-22174-8_14"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"PSLM Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) Selected Areas in Cryptography \u2013 SAC 2005. pp. 319\u2013331. Springer Berlin Heidelberg, Berlin, Heidelberg (2006).https:\/\/doi.org\/10.1007\/11693383_22"},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"Brezing, F., Weng, A.: Elliptic curves suitable for pairing based cryptography. Designs, Codes and Cryptography 37(1), 133\u2013141 (Oct 2005). https:\/\/doi.org\/10.1007\/s10623-004-3808-4","DOI":"10.1007\/s10623-004-3808-4"},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"Brickell, E., Camenisch, J., Chen, L.: Direct anonymous attestation. In: Proceedings of the 11th ACM Conference on Computer and Communications Security. pp. 132\u2013145. Association for Computing Machinery, New York, NY, USA (2004). https:\/\/doi.org\/10.1145\/1030083.1030103","DOI":"10.1145\/1030083.1030103"},{"key":"15_CR14","doi-asserted-by":"publisher","unstructured":"Chavez-Saab, J., Rodr\u00edguez-Henr\u00edquez, F., Tibouchi, M.: SwiftEC: Shallue-van de woestijne indifferentiable function to elliptic curves: Faster indifferentiable hashing to elliptic curves. In: Advances in Cryptology \u2013 ASIACRYPT 2022. pp. 63\u201392. Springer-Verlag, Berlin, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_3","DOI":"10.1007\/978-3-031-22963-3_3"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-030-65411-5_14","volume-title":"Cryptology and Network Security","author":"R Clarisse","year":"2020","unstructured":"Clarisse, R., Duquesne, S., Sanders, O.: Curves with fast computations in the first pairing group. In: Krenn, S., Shulman, H., Vaudenay, S. (eds.) Cryptology and Network Security \u2013 CNS2020. pp. 280\u2013298. Springer International Publishing, Cham (2020).https:\/\/doi.org\/10.1007\/978-3-030-65411-5_14"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-13013-7_14","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"C Costello","year":"2010","unstructured":"Costello, C., Lange, T., Naehrig, M.: Faster pairing computations on curves with high-degree twists. In: Nguyen, P.Q., Pointcheval, D. (eds.) Public Key Cryptography \u2013 PKC 2010. pp. 224\u2013242. Springer Berlin Heidelberg, Berlin, Heidelberg (2010).https:\/\/doi.org\/10.1007\/978-3-642-13013-7_14"},{"issue":"10","key":"15_CR17","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. Designs, Codes and Cryptography 91(10), 3141\u20133166 (2023). https:\/\/doi.org\/10.1007\/s10623-023-01223-7","journal-title":"Designs, Codes and Cryptography"},{"key":"15_CR18","doi-asserted-by":"publisher","unstructured":"Dai, Y., Zhang, F., Zhao, C.A.: Don\u2019t forget pairing-friendly curves with odd prime embedding degrees. IACR Transactions on Cryptographic Hardware and Embedded Systems 2023(4), 393\u2013419 (2023). https:\/\/doi.org\/10.46586\/tches.v2023.i4.393-419","DOI":"10.46586\/tches.v2023.i4.393-419"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.ffa.2023.102263","volume":"91","author":"Y Dai","year":"2023","unstructured":"Dai, Y., Zhang, F., Zhao, C.A.: Fast hashing to $$\\mathbb{G}_{2}$$ on pairing-friendly curves with the lack of twists. Finite Fields and Their Applications 91, 102\u2013263 (2023). https:\/\/doi.org\/10.1016\/j.ffa.2023.102263","journal-title":"Finite Fields and Their Applications"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-030-34578-5_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"L De Feo","year":"2019","unstructured":"De\u00a0Feo, L., Masson, S., Petit, C., Sanso, A.: Verifiable delay functions from supersingular isogenies and pairings. In: Galbraith, S.D., Moriai, S. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2019. pp. 248\u2013277. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_10"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-030-65411-5_13","volume-title":"Cryptology and Network Security","author":"Y El Housni","year":"2020","unstructured":"El\u00a0Housni, 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 \u2013 CANS 2020. pp. 259\u2013279. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65411-5_13"},{"key":"15_CR22","doi-asserted-by":"publisher","unstructured":"El\u00a0Housni, Y., Guillevic, A.: Families of SNARK-friendly 2-chains of elliptic curves. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2022. pp. 367\u2013396. Springer International Publishing, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_13","DOI":"10.1007\/978-3-031-07085-3_13"},{"key":"15_CR23","doi-asserted-by":"publisher","unstructured":"El\u00a0Housni, 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 \u2013 AFRICACRYPT 2022. pp. 518\u2013536. Springer Nature Switzerland, Cham (2022).https:\/\/doi.org\/10.1007\/978-3-031-17433-9_22","DOI":"10.1007\/978-3-031-17433-9_22"},{"issue":"2","key":"15_CR24","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D Freeman","year":"2010","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. Journal of Cryptology 23(2), 224\u2013280 (2010). https:\/\/doi.org\/10.1007\/s00145-009-9048-z","journal-title":"Journal of Cryptology"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-642-28496-0_25","volume-title":"Selected Areas in Cryptography","author":"L Fuentes-Casta\u00f1eda","year":"2012","unstructured":"Fuentes-Casta\u00f1eda, L., Knapp, E., Rodr\u00edguez-Henr\u00edquez, F.: Faster hashing to $$\\mathbb{G}_{2}$$. In: Miri, A., Vaudenay, S. (eds.) Selected Areas in Cryptography \u2013 SAC 2011. pp. 412\u2013430. Springer Berlin Heidelberg, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28496-0_25"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-642-01001-9_30","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"SD Galbraith","year":"2009","unstructured":"Galbraith, S.D., Lin, X., Scott, M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. In: Joux, A. (ed.) Advances in Cryptology - EUROCRYPT 2009. pp. 518\u2013535. Springer Berlin Heidelberg, Berlin, Heidelberg (2009)"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"RP Gallant","year":"2001","unstructured":"Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: Kilian, J. (ed.) Advances in Cryptology \u2014 CRYPTO 2001. pp. 190\u2013200. Springer Berlin Heidelberg, Berlin, Heidelberg (2001).https:\/\/doi.org\/10.1007\/3-540-44647-8_11"},{"key":"15_CR28","unstructured":"Granger, R., Smart, N.P.: On computing products of pairings. Cryptology ePrint Archive, Paper 2006\/172 (2006), https:\/\/eprint.iacr.org\/2006\/172"},{"key":"15_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-13013-7_13","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"R Granger","year":"2010","unstructured":"Granger, R., Scott, M.: Faster squaring in the cyclotomic subgroup of sixth degree extensions. In: Nguyen, P.Q., Pointcheval, D. (eds.) Public Key Cryptography \u2013 PKC 2010. pp. 209\u2013223. Springer Berlin Heidelberg, Berlin, Heidelberg (2010).https:\/\/doi.org\/10.1007\/978-3-642-13013-7_13"},{"key":"15_CR30","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 \u2013 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 \u2013 EUROCRYPT 2016. pp. 305\u2013326. Springer Berlin Heidelberg, Berlin, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"15_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-030-45388-6_19","volume-title":"Public-Key Cryptography \u2013 PKC 2020","author":"A Guillevic","year":"2020","unstructured":"Guillevic, A.: A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) Public-Key Cryptography \u2013 PKC 2020. pp. 535\u2013564. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_19"},{"issue":"6","key":"15_CR32","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1007\/s10623-020-00727-w","volume":"88","author":"A Guillevic","year":"2020","unstructured":"Guillevic, A., Masson, S., Thom\u00e9, E.: Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation. Designs, Codes and Cryptography 88(6), 1047\u20131081 (2020). https:\/\/doi.org\/10.1007\/s10623-020-00727-w","journal-title":"Designs, Codes and Cryptography"},{"key":"15_CR33","unstructured":"Guillevic, A., Singh, S.: On the alpha value of polynomials in the tower number field sieve algorithm. Mathematical Cryptology 1(1) (Feb 2021), open access at https:\/\/journals.flvc.org\/mathcryptology\/article\/view\/125142"},{"issue":"10","key":"15_CR34","doi-asserted-by":"publisher","first-page":"4595","DOI":"10.1109\/TIT.2006.881709","volume":"52","author":"F Hess","year":"2006","unstructured":"Hess, F., Smart, N.P., Vercauteren, F.: The Eta pairing revisited. IEEE Transactions on Information Theory 52(10), 4595\u20134602 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.881709","journal-title":"IEEE Transactions on Information Theory"},{"key":"15_CR35","volume-title":"Guide to pairing-based cryptography","author":"S Ionica","year":"2016","unstructured":"Ionica, S., Robert, D.: Pairings. In: El\u00a0Mrabet, N., Joye, M. (eds.) Guide to pairing-based cryptography. Chapman and Hall\/CRC Press, BocaRaton (2016)"},{"key":"15_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-04873-4_3","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2013","author":"A Joux","year":"2014","unstructured":"Joux, A., Pierrot, C.: The special number field sieve in $$\\mathbb{F} _{p^n}$$. In: Cao, Z., Zhang, F. (eds.) Pairing-Based Cryptography \u2013 Pairing 2013. pp. 45\u201361. Springer International Publishing, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04873-4_3"},{"key":"15_CR37","unstructured":"Karatsuba, A.: Multiplication of multidigit numbers on automata. In: Soviet physics doklady. vol.\u00a07, pp. 595\u2013596 (1963)"},{"key":"15_CR38","doi-asserted-by":"publisher","unstructured":"Kim, T., Barbulescu, R.: Extended tower number field sieve: A new complexity for the medium prime case. In: Robshaw, M., Katz, J. (eds.) Advances in Cryptology \u2013 CRYPTO 2016. pp. 543\u2013571. Springer Berlin Heidelberg, Berlin,Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_20","DOI":"10.1007\/978-3-662-53018-4_20"},{"key":"15_CR39","doi-asserted-by":"publisher","unstructured":"Koshelev, D.: Some remarks on how to hash faster onto elliptic curves. Journal of Computer Virology and Hacking Techniques (Mar 2024). https:\/\/doi.org\/10.1007\/s11416-024-00514-4","DOI":"10.1007\/s11416-024-00514-4"},{"key":"15_CR40","doi-asserted-by":"crossref","unstructured":"Lidl, R., Niederreiter, H.: Introduction to finite fields and their applications. Cambridge university press (1994)","DOI":"10.1017\/CBO9781139172769"},{"key":"15_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BFb0052240","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"CH Lim","year":"1997","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 \u2014 CRYPTO 1997. pp. 249\u2013263. Springer Berlin Heidelberg, Berlin, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052240"},{"issue":"4","key":"15_CR42","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"VS Miller","year":"2004","unstructured":"Miller, V.S.: The Weil pairing, and its efficient calculation. Journal of Cryptology 17(4), 235\u2013261 (2004). https:\/\/doi.org\/10.1007\/s00145-004-0315-8","journal-title":"Journal of Cryptology"},{"issue":"3","key":"15_CR43","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01933667","volume":"15","author":"JM Pollard","year":"1975","unstructured":"Pollard, J.M.: A Monte Carlo method for factorization. Bit Numerical Mathematics 15(3), 331\u2013334 (1975). https:\/\/doi.org\/10.1007\/BF01933667","journal-title":"Bit Numerical Mathematics"},{"issue":"1676","key":"15_CR44","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1098\/rsta.1993.0139","volume":"345","author":"O Schirokauer","year":"1993","unstructured":"Schirokauer, O.: Discrete logarithms and local units. Philosophical Transactions: Physical Sciences and Engineering 345(1676), 409\u2013423 (1993). https:\/\/doi.org\/10.1098\/rsta.1993.0139","journal-title":"Philosophical Transactions: Physical Sciences and Engineering"},{"key":"15_CR45","unstructured":"Scott, M.: Implementing cryptographic pairings. In: Proceedings of the First International Conference on Pairing-Based Cryptography \u2013 Pairing 2007. p. 177-196. Springer-Verlag, Berlin, Heidelberg (2007)"},{"key":"15_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-25516-8_18","volume-title":"Cryptography and Coding","author":"M Scott","year":"2011","unstructured":"Scott, M.: On the efficient implementation of pairing-based protocols. In: Chen, L. (ed.) Cryptography and Coding. pp. 296\u2013308. Springer Berlin Heidelberg, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25516-8_18"},{"key":"15_CR47","unstructured":"Scott, M.: A note on group membership tests for $$\\mathbb{G}_{1}$$, $$\\mathbb{G}_{2}$$ and $$\\mathbb{G}_{T}$$ on BLS pairing-friendly curves. Cryptology ePrint Archive, Report 2021\/1130 (2021), https:\/\/ia.cr\/2021\/1130"},{"key":"15_CR48","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\u00a0de Woestijne, C.E.: Construction of rational points on elliptic curves over finite fields. In: Hess, F., Pauli, S., Pohst, M. (eds.) Algorithmic Number Theory Symposium\u2013 ANTS 2006. pp. 510\u2013524. Springer Berlin Heidelberg, Berlin, Heidelberg (2006)"},{"issue":"1","key":"15_CR49","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F Vercauteren","year":"2009","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Transactions on Information Theory 56(1), 455\u2013461 (2009).https:\/\/doi.org\/10.1109\/TIT.2009.2034881","journal-title":"IEEE Transactions on Information Theory"},{"key":"15_CR50","unstructured":"Washington, L.C.: Elliptic curves: number theory and cryptography. Chapman and Hall\/CRC (2008)"},{"key":"15_CR51","doi-asserted-by":"publisher","first-page":"2260","DOI":"10.1109\/TIFS.2021.3051801","volume":"16","author":"K Yang","year":"2021","unstructured":"Yang, K., Chen, L., Zhang, Z., Newton, C.J., Yang, B., Xi, L.: Direct anonymous attestation with optimal TPM signing efficiency. IEEE Transactions on Information Forensics and Security 16, 2260\u20132275 (2021). https:\/\/doi.org\/10.1109\/TIFS.2021.3051801","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"15_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-642-34931-7_24","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"X Zhang","year":"2012","unstructured":"Zhang, X., Lin, D.: Analysis of optimum pairing products at high security levels. In: Galbraith, S., Nandi, M. (eds.) Progress in Cryptology - INDOCRYPT 2012. pp. 412\u2013430. Springer Berlin Heidelberg, Berlin, Heidelberg (2012)"},{"key":"15_CR53","doi-asserted-by":"publisher","unstructured":"Zhao, C.A., Zhang, F., Huang, J.: A note on the ate pairing. International Journal of Information Security 7(6), 379\u2013382 (Nov 2008). https:\/\/doi.org\/10.1007\/s10207-008-0054-1","DOI":"10.1007\/s10207-008-0054-1"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0888-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T09:36:31Z","timestamp":1733823391000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0888-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,11]]},"ISBN":["9789819608874","9789819608881"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0888-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,11]]},"assertion":[{"value":"11 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}