{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T14:19:29Z","timestamp":1783520369834,"version":"3.55.0"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032311290","type":"print"},{"value":"9783032311306","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-31130-6_11","type":"book-chapter","created":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T13:37:59Z","timestamp":1783517879000},"page":"263-287","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Complexity Reduction of\u00a0Final Exponentiation for\u00a0BLS12 and\u00a0BLS24 Curves"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-5690-7672","authenticated-orcid":false,"given":"Siradji","family":"Sadikou Gaya","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2954-201X","authenticated-orcid":false,"given":"Senegue Gomez","family":"Nyamsi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7729-0419","authenticated-orcid":false,"given":"Emmanuel","family":"Fouotsa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5769-1672","authenticated-orcid":false,"given":"Morou","family":"Amidou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,9]]},"reference":[{"issue":"3","key":"11_CR1","first-page":"44","volume":"1","author":"DF Aranha","year":"2024","unstructured":"Aranha, D.F., Fotiadis, G., Guillevic, A.: A short-list of pairing-friendly curves resistant to the special TNFS algorithm at the 192-bit security level. IACR Commun. Cryptol. (CIC) 1(3), 44 (2024)","journal-title":"IACR Commun. Cryptol. (CIC)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short signatures without random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56\u201373. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_4"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-68979-9_13","volume-title":"Trusted Computing - Challenges and Applications","author":"E Brickell","year":"2008","unstructured":"Brickell, E., Chen, L., Li, J.: A new direct anonymous attestation scheme from bilinear maps. In: Lipp, P., Sadeghi, A.-R., Koch, K.-M. (eds.) Trust 2008. LNCS, vol. 4968, pp. 166\u2013178. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68979-9_13"},{"key":"11_CR4","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":"11_CR5","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"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Barreto, P., Lynn, B., Scott, M.: Constructing elliptic curves with prescribed embedding degrees. In: SCN 2002. Springer, LNCS vol. 2576, pp. 257\u2013267 (2002)","DOI":"10.1007\/3-540-36413-7_19"},{"key":"11_CR7","unstructured":"Barbulescu, R., El Mrabet, N., and Ghammam, L.: A taxonomy of pairings, their security, their complexity. Cryptology ePrint Archive, Report 2019\/485 (2019)"},{"key":"11_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546570","volume-title":"Advances in Elliptic Curve Cryptography","author":"IF Blake","year":"2005","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Advances in Elliptic Curve Cryptography. Cambridge University Press (2005)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-28628-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J Camenisch","year":"2004","unstructured":"Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 56\u201372. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_4"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-85538-5_1","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"L Chen","year":"2008","unstructured":"Chen, L., Morrissey, P., Smart, N.P.: Pairings in trusted computing. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 1\u201317. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85538-5_1"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Cai, S., Hu, Z., Zhao, C.: Faster final exponentiation on the KSS18 curve. IEICE Trans. Fundament. E105.A(8), 1162\u20131164 (2022)","DOI":"10.1587\/transfun.2021EAL2086"},{"key":"11_CR12","first-page":"177","volume":"7708","author":"DF Aranha","year":"2013","unstructured":"Aranha, D.F., et al.: Implementing pairings at the 192-bit security level. LNCS, Springer 7708, 177\u2013195 (2013)","journal-title":"LNCS, Springer"},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1515\/jmc-2013-0033","volume":"8","author":"S Duquesne","year":"2014","unstructured":"Duquesne, S., El Mrabet, N., Fouotsa, E.: Efficient computation of pairings on Jacobi quartic elliptic curves. J. Math. Cryptol. 8(4), 331\u2013362 (2014)","journal-title":"J. Math. Cryptol."},{"key":"11_CR14","first-page":"424","volume":"12006","author":"D Hayashida","year":"2020","unstructured":"Hayashida, D., Hayasaka, K., Teruya, T.: Efficient final exponentiation via cyclotomic structure for pairings over families of elliptic curves. topics in cryptology - CT-RSA 2020. LNCS 12006, 424\u2013444 (2020)","journal-title":"LNCS"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Fuentes-Casta\u00f1eda, L., Knapp, E., Rodr\u00edguez-Henr\u00edquez, F.: Faster hashing to G2. Selected Areas in Cryptography, pp. 412\u2013430. Springer (2012)","DOI":"10.1007\/978-3-642-28496-0_25"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2019.10.017","volume":"800","author":"G Fotiadis","year":"2019","unstructured":"Fotiadis, G., Konstantinou, E.: TNFS resistant families of pairing-friendly elliptic curves. J. Theor. Comput. Sci.(TCS) 800, 73\u201389 (2019)","journal-title":"J. Theor. Comput. Sci.(TCS)"},{"key":"11_CR17","unstructured":"Fotiadis, G., Martindale, C.: Optimal tnfs-secure pairings on elliptic curves with composite embedding degree. IACR Cryptol. ePrint Arch, p. 555. (2019)"},{"key":"11_CR18","first-page":"127","volume":"281","author":"QY Feng","year":"2013","unstructured":"Feng, Q.Y., et al.: Super-optimal pairings. Mech. Eng., Mater. Energy II, Trans. Tech. Public. Ltd. 281, 127\u2013133 (2013)","journal-title":"Mech. Eng., Mater. Energy II, Trans. Tech. Public. Ltd."},{"issue":"2","key":"11_CR19","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. J. Cryptol. 23(2), 224\u2013280 (2010)","journal-title":"J. Cryptol."},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Fouotsa, E., Guimagang, L.A., Ayissi, R.: X-superoptimal pairings on elliptic curves with odd prime embedding degrees. AAECC 1\u201319,(2023). https:\/\/doi.org\/10.1007\/s00200-023-00596-5","DOI":"10.1007\/s00200-023-00596-5"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ffa.2014.02.009","volume":"29","author":"JE Guzm\u00e1n-Trampe","year":"2014","unstructured":"Guzm\u00e1n-Trampe, J.E., et al.: Low-cost addition-subtraction sequences for the final exponentiation in pairings. Finite Fields Appl. 29, 1\u201317 (2014)","journal-title":"Finite Fields Appl."},{"key":"11_CR22","unstructured":"Ghammam, L. and Fouotsa, E.: On the computation of the optimal ate pairing at the 192-bit security level. Cryptology ePrint Archive, Report 2016\/130 (2016)"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s12190-018-1167-y","volume":"59","author":"L Ghammam","year":"2019","unstructured":"Ghammam, L., Fouotsa, E.: Improving the computation of the optimal ate pairing for a high security level. J. Appl. Math. Comput. 59, 21\u201336 (2019)","journal-title":"J. Appl. Math. Comput."},{"key":"11_CR24","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.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"issue":"6","key":"11_CR25","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. Des. Codes Crypt. 88(6), 1047\u20131081 (2020)","journal-title":"Des. Codes Crypt."},{"key":"11_CR26","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.) PKC 2020. LNCS, vol. 12111, pp. 535\u2013564. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_19"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Iida, T., et al.: Improvement of optimal-ate pairing on cocks-pinch curve with embedding degree 6 in affine coordinates. In: CANDAR, pp. 309\u2013315 (2022)","DOI":"10.1109\/CANDARW57323.2022.00043"},{"issue":"4","key":"11_CR28","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. (JOC) 17(4), 263\u2013276 (2004)","journal-title":"J. Cryptol. (JOC)"},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-662-53018-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"T Kim","year":"2016","unstructured":"Kim, T., Barbulescu, R.: Extended tower number field sieve: a new complexity for the medium prime case. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 543\u2013571. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_20"},{"key":"11_CR30","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.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 177\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11"},{"key":"11_CR31","unstructured":"Ghammam, L.: Optimizing Final Exponentiation for Pairing-Friendly Elliptic Curves. Cryptology ePrint Archive (2025). Paper 2025\/384"},{"issue":"1","key":"11_CR32","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1504\/IJACT.2020.107167","volume":"4","author":"NB Mbiang","year":"2020","unstructured":"Mbiang, N.B., Aranha, D.D.F., Fouotsa, E.: Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48. Int. J. Appl. Cryptograph. 4(1), 45\u201359 (2020)","journal-title":"Int. J. Appl. Cryptograph."},{"issue":"5","key":"11_CR33","doi-asserted-by":"publisher","first-page":"2350054","DOI":"10.1142\/S1793830923500544","volume":"16","author":"SG Nyamsi","year":"2024","unstructured":"Nyamsi, S.G., Fouotsa, E., Tcheka, C.: Faster optimal ate pairings for cyclotomic sparse families of curves. Discr. Math., Algorithms Appl. 16(5), 2350054 (2024)","journal-title":"Discr. Math., Algorithms Appl."},{"issue":"1","key":"11_CR34","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0196-6774(81)90003-1","volume":"2","author":"J Olivos","year":"1981","unstructured":"Olivos, J.: On vectorial addition chains. J. Algorithms 2(1), 13\u201321 (1981)","journal-title":"J. Algorithms"},{"key":"11_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-319-29485-8_7","volume-title":"Topics in Cryptology \u2013 CT-RSA 2016","author":"D Pointcheval","year":"2016","unstructured":"Pointcheval, D., Sanders, O.: Short randomizable signatures. In: Sako, K. (ed.) CT-RSA 2016. LNCS, vol. 9610, pp. 111\u2013126. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29485-8_7"},{"issue":"4","key":"11_CR36","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1007\/s00145-018-9280-5","volume":"32","author":"R Barbulescu","year":"2019","unstructured":"Barbulescu, R., Duquesne, S.: Updating key size estimations for pairings. J. Cryptol. (JOC) 32(4), 1298\u20131336 (2019)","journal-title":"J. Cryptol. (JOC)"},{"key":"11_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-03298-1_6","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"M Scott","year":"2009","unstructured":"Scott, M., Benger, N., Charlemagne, M., Dominguez Perez, L.J., Kachisa, E.J.: On the final exponentiation for calculating pairings on ordinary elliptic curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 78\u201388. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03298-1_6"},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"Tessaro, S., Zhu, C.: Revisiting BBS signatures. Adv. Cryptol. (EUROCRYPT). Springer, LNCS 14008, 691\u2013721 (2023)","DOI":"10.1007\/978-3-031-30589-4_24"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"Nyamsi, S.G., Azebaze Guimagang, L., Fouotsa, E.: Accelerating pairings on BW10 and BW14 curves. Cryptologia, 49(5), 486\u2013504 (2025). https:\/\/doi.org\/10.1080\/01611194.2024.2439496","DOI":"10.1080\/01611194.2024.2439496"},{"issue":"1","key":"11_CR40","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F Vercauteren","year":"2010","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Trans. Inf. Theory 56(1), 455\u2013461 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR41","unstructured":"Haddaji, W.: Efficient Pairings Final Exponentiation Using Cyclotomic Cubing. Cryptology ePrint Archive (2025). Paper 2025\/958"},{"key":"11_CR42","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.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 412\u2013430. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34931-7_24"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-31130-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T13:38:02Z","timestamp":1783517882000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-31130-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032311290","9783032311306"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-31130-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"9 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have influenced the objectivity or the results reported in this manuscript.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}},{"value":"This research is purely mathematical and did not involve any studies with human participants or animal subjects conducted by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Standards"}},{"value":"Not applicable, as the study does not contain any individual person\u2019s data in any form.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hammamet","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tunisia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/africacrypt2026.tn","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}