{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:39:31Z","timestamp":1759365571726,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":61,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032067531","type":"print"},{"value":"9783032067548","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:00:00Z","timestamp":1759363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:00:00Z","timestamp":1759363200000},"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-032-06754-8_8","type":"book-chapter","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T08:23:49Z","timestamp":1759307029000},"page":"209-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Tate Profile"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-8015-399X","authenticated-orcid":false,"given":"Krijn","family":"Reijnders","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,2]]},"reference":[{"key":"8_CR1","unstructured":"Aardal, M.A., et al.: SQIsign 2.0: Algorithm specifications and supporting documentation. Technical report (2025)"},{"key":"8_CR2","doi-asserted-by":"crossref","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, pp. 3228\u20133238 (2023)","DOI":"10.1145\/3576915.3616597"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s00145-014-9188-7","volume":"29","author":"JW Bos","year":"2016","unstructured":"Bos, J.W., Costello, C., Hisil, H., Lauter, K.: Fast cryptography in genus 2. J. Cryptol. 29(1), 28\u201360 (2016)","journal-title":"J. Cryptol."},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-22174-8_14","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2015","author":"PSLM Barreto","year":"2015","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.) LATINCRYPT 2015. LNCS, vol. 9230, pp. 245\u2013265. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22174-8_14"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., De Feo, L., Leroux, A., Smith, B.: Faster computation of isogenies of large prime degree. In: ANTS-XIV-14th Algorithmic Number Theory Symposium, vol. 4, pp. 39\u201355. Mathematical Sciences Publishers (2020)","DOI":"10.2140\/obs.2020.4.39"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416\u2013432. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_26"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Hamburg, M., Krasnova, A., Lange, T.: Elligator: elliptic-curve points indistinguishable from uniform random strings. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, pp. 967\u2013980 (2013)","DOI":"10.1145\/2508859.2516734"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"PSLM Barreto","year":"2002","unstructured":"Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 354\u2013369. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_23"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00145-004-0311-z","volume":"17","author":"PS Barreto","year":"2004","unstructured":"Barreto, P.S., Lynn, B., Scott, M.: Efficient implementation of pairing-based cryptosystems. J. Cryptol. 17(4), 321\u2013334 (2004)","journal-title":"J. Cryptol."},{"key":"8_CR12","unstructured":"Bowe, S.: Faster Subgroup Checks for BLS12-381. Cryptology ePrint Archive, Paper 2019\/814 (2019). https:\/\/eprint.iacr.org\/2019\/814"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Bruin, P.: The Tate pairing for abelian varieties over finite fields. J. de theorie des nombres de Bordeaux 23(2), 323\u2013328 (2011)","DOI":"10.5802\/jtnb.764"},{"issue":"4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-8858(86)90023-0","volume":"7","author":"DV Chudnovsky","year":"1986","unstructured":"Chudnovsky, D.V., Chudnovsky, G.V.: Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Adv. Appl. Math. 7(4), 385\u2013434 (1986)","journal-title":"Adv. Appl. Math."},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-030-64834-3_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"W Castryck","year":"2020","unstructured":"Castryck, W., Decru, T., Vercauteren, F.: Radical isogenies. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 493\u2013519. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_17"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Corte-Real Santos, M., Eriksen, J.K., Meyer, M., Reijnders, K.: Apr\u00e9sSQI: extra fast verification for SQIsign using extension-field signing. In: Advances in Cryptology - EUROCRYPT 2024 - 43nd Annual International Conference on the Theory and Applications of Cryptographic Techniques (2024)","DOI":"10.1007\/978-3-031-58716-0_3"},{"key":"8_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526084","volume-title":"Prolegomena to a Middlebrow Arithmetic of Curves of Genus 2","author":"JWS Cassels","year":"1996","unstructured":"Cassels, J.W.S., Flynn, E.V.: Prolegomena to a Middlebrow Arithmetic of Curves of Genus 2, vol. 230. Cambridge University Press, Cambridge (1996)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Castryck, W., Houben, M., Merz, S.P., Mula, M., van Buuren, S., Vercauteren, F.: Weak instances of class group action based cryptography via self-pairings. In: Annual International Cryptology Conference, pp. 762\u2013792. Springer, Heidelberg (2023)","DOI":"10.1007\/978-3-031-38548-3_25"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-319-56620-7_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"C Costello","year":"2017","unstructured":"Costello, C., Jao, D., Longa, P., Naehrig, M., Renes, J., Urbanik, D.: Efficient compression of SIDH public keys. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 679\u2013706. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_24"},{"key":"8_CR20","unstructured":"Corte-Real Santos, M., Reijnders, K.: Return of the Kummer: a Toolbox for Genus-2 Cryptography. Cryptology ePrint Archive, Paper 2024\/948 (2024). https:\/\/eprint.iacr.org\/2024\/948"},{"key":"8_CR21","unstructured":"Dai, Y., He, D., Koshelev, D., Peng, C., Yang, Z.: Revisiting subgroup membership testing on pairing-friendly curves via the Tate pairing. Cryptology ePrint Archive, Paper 2024\/1790 (2024). https:\/\/eprint.iacr.org\/2024\/1790"},{"issue":"3","key":"8_CR22","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1515\/jmc-2012-0015","volume":"8","author":"L Feo","year":"2014","unstructured":"Feo, L., Jao, D., Pl\u00fbt, J.: Towards quantumresistant cryptosystems from supersingular elliptic curve isogenies. J. Math. Cryptol. 8(3), 209\u2013247 (2014)","journal-title":"J. Math. Cryptol."},{"issue":"5","key":"8_CR23","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00200-018-0349-z","volume":"29","author":"J Doliskani","year":"2018","unstructured":"Doliskani, J.: On division polynomial PIT and supersingularity. Appl. Algebra Eng. Commun. Comput. 29(5), 393\u2013407 (2018)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"206","key":"8_CR24","first-page":"865","volume":"62","author":"G Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.-G.: A remark concerning mdivisibility and the discrete logarithm in the divisor class group of curves. Math. Comput. 62(206), 865\u2013874 (1994)","journal-title":"Math. Comput."},{"key":"8_CR25","unstructured":"Galbraith, S.D.: Pairings. In: London Mathematics Society Lecture Note Series, vol. 317 (2005)"},{"issue":"3","key":"8_CR26","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1515\/JMC.2007.012","volume":"1","author":"P Gaudry","year":"2007","unstructured":"Gaudry, P.: Fast genus 2 arithmetic based on Theta functions. J. Math. Cryptol. 1(3), 243\u2013265 (2007)","journal-title":"J. Math. Cryptol."},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-45455-1_26","volume-title":"Algorithmic Number Theory","author":"SD Galbraith","year":"2002","unstructured":"Galbraith, S.D., Harrison, K., Soldera, D.: Implementing the tate pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 324\u2013337. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45455-1_26"},{"issue":"4","key":"8_CR28","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.jsc.2011.09.003","volume":"47","author":"P Gaudry","year":"2012","unstructured":"Gaudry, P., Schost, \u00c9.: Genus 2 point counting over prime fields. J. Symb. Comput. 47(4), 368\u2013400 (2012)","journal-title":"J. Symb. Comput."},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-48910-X_14","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"R Harasawa","year":"1999","unstructured":"Harasawa, R., Shikata, J., Suzuki, J., Imai, H.: Comparing the MOV and FR reductions in elliptic curve cryptography. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 190\u2013205. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_14"},{"issue":"281","key":"8_CR30","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1090\/S0025-5718-2012-02622-6","volume":"82","author":"S Ionica","year":"2013","unstructured":"Ionica, S., Joux, A.: Pairing the volcano. Math. Comput. 82(281), 581\u2013603 (2013)","journal-title":"Math. Comput."},{"key":"8_CR31","unstructured":"Jao, D., et al.: SIKE: supersingular isogeny key encapsulation. Technical report (2017)"},{"key":"8_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-45455-1_3","volume-title":"Algorithmic Number Theory","author":"A Joux","year":"2002","unstructured":"Joux, A.: The weil and tate pairings as building blocks for public key cryptosystems. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 20\u201332. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45455-1_3"},{"issue":"4","key":"8_CR33","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00145-004-0312-y","volume":"17","author":"A Joux","year":"2004","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. J. Cryptol. 17(4), 263\u2013276 (2004)","journal-title":"J. Cryptol."},{"issue":"177","key":"8_CR34","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)","journal-title":"Math. Comput."},{"key":"8_CR35","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"N Koblitz","year":"1989","unstructured":"Koblitz, N.: Hyperelliptic cryptosystems. J. Cryptol. 1, 139\u2013150 (1989)","journal-title":"J. Cryptol."},{"issue":"1","key":"8_CR36","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/S13389-022-00296-9","volume":"13","author":"DI Koshelev","year":"2023","unstructured":"Koshelev, D.I.: Subgroup membership testing on elliptic curves via the Tate pairing. J. Cryptogr. Eng. 13(1), 125\u2013128 (2023). https:\/\/doi.org\/10.1007\/S13389-022-00296-9","journal-title":"J. Cryptogr. Eng."},{"key":"8_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-12146-4_1","volume-title":"Information Security and Cryptology \u2013 ICISC 2018","author":"T Koshiba","year":"2019","unstructured":"Koshiba, T., Takashima, K.: New assumptions on isogenous pairing groups with applications to attribute-based encryption. In: Lee, K. (ed.) ICISC 2018. LNCS, vol. 11396, pp. 3\u201319. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12146-4_1"},{"issue":"2","key":"8_CR38","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/BF01389795","volume":"7","author":"S Lichtenbaum","year":"1969","unstructured":"Lichtenbaum, S.: Duality theorems for curves over p-adic fields. Inventiones mathematicae 7(2), 120\u2013136 (1969)","journal-title":"Inventiones mathematicae"},{"key":"8_CR39","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.) CRYPTO 1997. LNCS, vol. 1294, pp. 249\u2013263. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052240"},{"key":"8_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-14518-6_21","volume-title":"Algorithmic Number Theory","author":"D Lubicz","year":"2010","unstructured":"Lubicz, D., Robert, D.: Efficient pairing computation with theta functions. In: Hanrot, G., Morain, F., Thom\u00e9, E. (eds.) ANTS 2010. LNCS, vol. 6197, pp. 251\u2013269. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14518-6_21"},{"key":"8_CR41","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.jsc.2014.08.001","volume":"67","author":"D Lubicz","year":"2015","unstructured":"Lubicz, D., Robert, D.: A generalisation of Miller\u2019s algorithm and applications to pairing computations on abelian varieties. J. Symb. Comput. 67, 68\u201392 (2015)","journal-title":"J. Symb. Comput."},{"key":"8_CR42","doi-asserted-by":"publisher","unstructured":"Lubicz, D., Robert, D.: Arithmetic on Abelian and Kummer varieties. Finite Fields Appl. 39, 130\u2013158 (2016). https:\/\/doi.org\/10.1016\/j.ffa.2016.01.009. eprint: 2014\/493, HAL: hal-01057467","DOI":"10.1016\/j.ffa.2016.01.009"},{"key":"8_CR43","unstructured":"luigi1111 and Riccardo \u201cfluffypony\u201d Spagni. Disclosure of a Major Bug in CryptoNote-Based Currencies (2017). Accessed 23 Apr 2025. https:\/\/www.getmonero.org\/2017\/05\/17\/disclosure-of-a-major-bug-in-cryptonote-based-currencies.html"},{"issue":"9","key":"8_CR44","doi-asserted-by":"publisher","first-page":"6679","DOI":"10.1109\/TIT.2024.3423675","volume":"70","author":"K Lin","year":"2024","unstructured":"Lin, K., Wang, W., Xu, Z., Zhao, C.A.: A faster software implementation of SQISign. IEEE Trans. Inf. Theory 70(9), 6679\u20136689 (2024)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR45","doi-asserted-by":"publisher","unstructured":"McLoughlin, M.B.: addchain: cryptographic addition chain generation in Go. repository (2021). https:\/\/github.com\/mmcloughlin\/ addchain. Version 0.4.0. https:\/\/doi.org\/10.5281\/zenodo.5622943","DOI":"10.5281\/zenodo.5622943"},{"issue":"4","key":"8_CR46","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. J. Cryptol. 17(4), 235\u2013261 (2004)","journal-title":"J. Cryptol."},{"key":"8_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201985 Proceedings","author":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417\u2013426. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_31"},{"key":"8_CR48","doi-asserted-by":"crossref","unstructured":"Macula, J., Stange, K.E.: Extending class group action attacks via sesquilinear pairings. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 371\u2013395. Springer, Heidelberg (2024)","DOI":"10.1007\/978-981-96-0891-1_12"},{"key":"8_CR49","doi-asserted-by":"crossref","unstructured":"Menezes, A., Vanstone, S., Okamoto, T.: Reducing elliptic curve logarithms to logarithms in a finite field. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, pp. 80\u201389 (1991)","DOI":"10.1145\/103418.103434"},{"key":"8_CR50","unstructured":"Pornin, T.: Faster modular inversion and Legendre symbol, and an X25519 speed record (2020). https:\/\/www.nccgroup.com\/us\/research-blog\/faster-modular-inversion-and-legendre-symbol-and-an-x25519-speed-record0\/"},{"key":"8_CR51","doi-asserted-by":"publisher","unstructured":"Pope, G., Reijnders, K., Robert, D., Sferlazza, A., Smith, B: Simpler and faster pairings from the montgomery ladder. IACR Commun. Cryptol. 2(2), 29 (2025). https:\/\/doi.org\/10.62056\/AH2I893Y6","DOI":"10.62056\/AH2I893Y6"},{"key":"8_CR52","doi-asserted-by":"crossref","unstructured":"Reijnders, K.: Effective pairings in isogeny-based cryptography. In: International Conference on Cryptology and Information Security in Latin America, pp. 109\u2013128. Springer, Heidelberg (2023)","DOI":"10.1007\/978-3-031-44469-2_6"},{"key":"8_CR53","unstructured":"Robert, D.: The geometric interpretation of the Tate pairing and its applications. Cryptology ePrint Archive, Paper 2023\/177 (2023). https:\/\/eprint.iacr.org\/2023\/177"},{"key":"8_CR54","unstructured":"Robert, D.: Fast pairings via biextensions and cubical arithmetic. Cryptology ePrint Archive, Paper 2024\/517 (2024). https:\/\/eprint.iacr.org\/2024\/517"},{"key":"8_CR55","unstructured":"Scholten, J.: Weil restriction of an elliptic curve over a quadratic extension (2003)"},{"key":"8_CR56","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 (2021). https:\/\/eprint.iacr.org\/2021\/1130"},{"key":"8_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-540-73489-5_19","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"KE Stange","year":"2007","unstructured":"Stange, K.E.: The tate pairing via elliptic nets. In: Takagi, T., Okamoto, E., Okamoto, T., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 329\u2013348. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73489-5_19"},{"key":"8_CR58","unstructured":"Tate, J.: Duality theorems in Galois cohomology over number fields. In: Proceedings of International Congress Mathematicians (Stockholm, 1962), pp. 288\u2013295 (1962)"},{"key":"8_CR59","unstructured":"V\u00e9lu, J.: Isog\u00e9nies entre courbes elliptiques. In: Comptes- Rendus de l\u2019Acad\u00e9mie des Sciences, vol. 273, pp. 238\u2013241 (1971). https:\/\/gallica.bnf.fr\/ark:\/12148\/cb34416987n\/date"},{"issue":"1","key":"8_CR60","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 Trans. Inf. Theory 56(1), 455\u2013461 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"8_CR61","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1109\/TC.2018.2878829","volume":"68","author":"GH Zanon","year":"2018","unstructured":"Zanon, G.H., Simplicio, M.A., Pereira, G.C., Doliskani, J., Barreto, P.S.: Faster key compression for isogeny-based cryptosystems. IEEE Trans. Comput. 68(5), 688\u2013701 (2018)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-06754-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T08:24:01Z","timestamp":1759307041000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-06754-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,2]]},"ISBN":["9783032067531","9783032067548"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-06754-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,2]]},"assertion":[{"value":"2 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATINCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Information Security in Latin America","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Medell\u00edn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colombia","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":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latincrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciencias.medellin.unal.edu.co\/eventos\/latincrypt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}