{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T17:39:29Z","timestamp":1755797969723},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2022,6,22]],"date-time":"2022-06-22T00:00:00Z","timestamp":1655856000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,22]],"date-time":"2022-06-22T00:00:00Z","timestamp":1655856000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s11786-022-00531-w","type":"journal-article","created":{"date-parts":[[2022,6,22]],"date-time":"2022-06-22T06:02:59Z","timestamp":1655877779000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Faster Beta Weil Pairing on BLS Pairing Friendly Curves with Odd Embedding Degree"],"prefix":"10.1007","volume":"16","author":[{"given":"Azebaze Guimagang","family":"Laurian","sequence":"first","affiliation":[]},{"given":"Fouotsa","family":"Emmanuel","sequence":"additional","affiliation":[]},{"given":"El Mrabet","family":"Nadia","sequence":"additional","affiliation":[]},{"given":"Pecha Njiahouo","family":"Aminatou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,22]]},"reference":[{"key":"531_CR1","doi-asserted-by":"crossref","unstructured":"Kinoshita, K., Suzuki, K.: Accelerating Beta Weil pairing with precomputation and multi-pairing techniques. In Aoki, K., Kanaoka, A. (eds.) Advances in Information and Computer Security - 15th International Workshop on Security, IWSEC 2020, Fukui, Japan, September 2-4, 2020, Proceedings, Lecture Notes in Computer Science, vol. 12231, pp. 261\u2013281. Springer, (2020)","DOI":"10.1007\/978-3-030-58208-1_15"},{"key":"531_CR2","doi-asserted-by":"crossref","unstructured":"Silvermann J.H.: The Arithmetic of elliptic curves. graduate texts in Mathematics. vol. 106. Springer-Verlag, (1986)","DOI":"10.1007\/978-1-4757-1920-8"},{"key":"531_CR3","first-page":"213","volume-title":"In Advances in cryptology - Crypto\u20192001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Matthew, K.F.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) In Advances in cryptology - Crypto\u20192001, vol. 2139, pp. 213\u2013229. Springer, Berlin Heidelberg (2001)"},{"issue":"4","key":"531_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J Cryptology 17(4), 297\u2013319 (2004)","journal-title":"J Cryptology"},{"key":"531_CR5","doi-asserted-by":"crossref","unstructured":"Joux A.: A one round protocol for tripartite diffie-hellman. In: Algorithmic Number Theory, 4th International Symposium, ANTS-IV, Leiden, The Netherlands, July 2-7, 2000, Proceedings, vol. 1838, pp. 385\u2013394. (2000)","DOI":"10.1007\/10722028_23"},{"key":"531_CR6","first-page":"140","volume-title":"Compressed pairings.","author":"M Scott","year":"2004","unstructured":"Scott, M., Barreto, P.S.L.M.: Advances in cryptology - Crypto\u20192004. In: Matt, F. (ed.) Compressed pairings., vol. 3152, pp. 140\u2013156. Springer-Verlag, Berlin (2004)"},{"issue":"1","key":"531_CR7","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":"531_CR8","doi-asserted-by":"crossref","unstructured":"Aranha, D.F., Knapp, E., Menezes, A., Rodr\u00edguez-Henr\u00edquez, F.: Parallelizing the Weil and Tate pairings. In: Chen, L. (ed.), Cryptography and Coding - 13th IMA International Conference, IMACC 2011, Oxford, UK, December 12-15, 2011. Proceedings, Lecture Notes in Computer Science, vol. 7089, pp. 275\u2013295. Springer, (2011)","DOI":"10.1007\/978-3-642-25516-8_17"},{"key":"531_CR9","doi-asserted-by":"crossref","unstructured":"Aranha, D.F., Casta\u00f1eda, L.F., 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 - Pairing 2012 - 5th International Conference, Cologne, Germany, May 16-18, 2012, Revised Selected Papers. Lecture Notes in Computer Science, vol. 7708, pp. 177\u2013195. Springer, (2012)","DOI":"10.1007\/978-3-642-36334-4_11"},{"key":"531_CR10","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s13370-019-00653-8","volume":"30","author":"E Fouotsa","year":"2019","unstructured":"Fouotsa, E., Pecha, A., El Mrabet, N.: Beta Weil pairing revisited. Afr. Mat. 30, 371\u2013388 (2019)","journal-title":"Afr. Mat."},{"issue":"1","key":"531_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10623-010-9383-y","volume":"58","author":"C Zhao","year":"2011","unstructured":"Zhao, C., Xie, D., Zhang, F., Zhang, J., Chen, B.L.: Computing bilinear pairings on elliptic curves with automorphisms. Des. Codes Cryptogr. 58(1), 35\u201344 (2011)","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"531_CR12","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/s00145-010-9065-y","volume":"24","author":"SD Galbraith","year":"2011","unstructured":"Galbraith, S.D., Lin, X., Scott, M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. J Cryptology 24(3), 446\u2013469 (2011)","journal-title":"J Cryptology"},{"key":"531_CR13","unstructured":"Zhang, X., Lin, D.: Analysis of optimum pairing products at high security levels. In: Galbraith, S.D., Nandi, M. (eds.) Progress in Cryptology - INDOCRYPT 2012, 13th International Conference on Cryptology in India, Kolkata, India, December 9-12, 2012. Proceedings, Lecture Notes in Computer Science, vol. 7668, pp. 412\u2013430. Springer, (2012)"},{"key":"531_CR14","first-page":"485","volume":"2019","author":"R Barbulescu","year":"2019","unstructured":"Barbulescu, R., El Mrabet, N., Ghammam, L.: A taxonomy of pairings, their security, their complexity. IACR Cryptology ePrint Arch. 2019, 485 (2019)","journal-title":"IACR Cryptology ePrint Arch."},{"issue":"4","key":"531_CR15","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"SV Miller","year":"2004","unstructured":"Miller, S.V.: The Weil pairing, and its efficient calculation. J Cryptology 17(4), 235\u2013261 (2004)","journal-title":"J Cryptology"},{"key":"531_CR16","doi-asserted-by":"crossref","unstructured":"Feng, Q.Y., Ming, T.C., Baoan, G., Zhi, X.M.: Super-optimal pairings. In: Mechanical Engineering, Materials and Energy II. Applied Mechanics and Materials, vol. 281, pp 127\u2013133. Trans Tech Publications Ltd, 3 (2013)","DOI":"10.4028\/www.scientific.net\/AMM.281.127"},{"key":"531_CR17","doi-asserted-by":"crossref","unstructured":"Fouotsa, E., El Mrabet, N., Pecha, A.: Optimal Ate pairing on elliptic curves with embedding degree 9, 15 and 27. journal of Groups, Complexity, Cryptology, 12, (2020)","DOI":"10.46298\/jgcc.2020.12.1.6167"},{"key":"531_CR18","doi-asserted-by":"crossref","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 - 19th International Conference, CANS 2020, Vienna, Austria, December 14-16, 2020, Proceedings, Lecture Notes in Computer Science, vol. 12579, pp. 280\u2013298. Springer, (2020)","DOI":"10.1007\/978-3-030-65411-5_14"},{"key":"531_CR19","doi-asserted-by":"crossref","unstructured":"Lavice, A., El\u00a0Mrabet, N., Berzati, A., Rigaud, J.B., Proy, J.: Hardware implementations of pairings at updated security levels. In Grosso, V., P\u00f6ppelmann, T. (eds.) Smart Card Research and Advanced Applications - 20th International Conference, CARDIS 2021, L\u00fcbeck, Germany, November 11-12, 2021, Revised Selected Papers. Lecture Notes in Computer Science, vol. 13173, pp. 189\u2013209. Springer, (2021)","DOI":"10.1007\/978-3-030-97348-3_11"},{"issue":"1","key":"531_CR20","first-page":"55","volume":"8","author":"Emmanuel Fouotsa and Abdoul Aziz Ciss","year":"2016","unstructured":"Emmanuel Fouotsa and Abdoul Aziz Ciss: Faster ate pairing computation on selmer\u2019s model of elliptic curves. Groups Complexity Cryptology 8(1), 55\u201367 (2016)","journal-title":"Groups Complexity Cryptology"},{"key":"531_CR21","doi-asserted-by":"crossref","unstructured":"Narcisse\u00a0Bang Mbiang, Diego de\u00a0Freitas\u00a0Aranha, and Emmanuel Fouotsa. Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level. International Journal of Applied Cryptography, 4(1):45\u201359, 2020","DOI":"10.1504\/IJACT.2020.107167"},{"key":"531_CR22","doi-asserted-by":"crossref","unstructured":"El\u00a0Mrabet, N., Fouotsa, E.: Failure of the point blinding countermeasure against fault attack in pairing-based cryptography. In: El Hajji, S., Nitaj, A., Carlet, C., Souidi, E.M. (eds.) Codes, Cryptology, and Information Security - First International Conference, C2SI 2015, Rabat, Morocco, May 26-28, 2015, Proceedings - In Honor of Thierry Berger. Lecture Notes in Computer Science, vol. 9084, pp. 259\u2013273. Springer, (2015)","DOI":"10.1007\/978-3-319-18681-8_21"},{"key":"531_CR23","doi-asserted-by":"crossref","unstructured":"Bl\u00f6mer, J., Gomes da\u00a0Silva,\u00a0R., G\u00fcnther, P., Kr\u00e4mer, J., Seifert, J.P.: A practical second-order fault attack against a real-world pairing implementation. IACR Cryptol. ePrint Arch., page 543, (2014)","DOI":"10.1109\/FDTC.2014.22"},{"key":"531_CR24","unstructured":"Weng, J., Dou, Y., Chuangui, Ma., El\u00a0Mrabet N.: Fault attacks against the miller algorithm in hessian coordinates. In: Wu, C., Yung, M., Lin, D. (eds.) Information Security and Cryptology - 7th International Conference, Inscrypt 2011, Beijing, China, November 30 - December 3, 2011. Revised Selected Papers. Lecture Notes in Computer Science, vol. 7537, pp. 102\u2013112. Springer, (2011)"},{"key":"531_CR25","unstructured":"Scott, M.: Pairing implementation revisited. IACR Cryptology ePrint Arch., page\u00a077, (2019)"},{"key":"531_CR26","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-30574-3_20","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"M Scott","year":"2005","unstructured":"Scott, M.: Computing the Tate pairing. In: Menezes, A. (ed.) Topics in Cryptology \u2013 CT-RSA 2005, pp. 293\u2013304. Springer, Berlin Heidelberg (2005)"},{"key":"531_CR27","unstructured":"Azebaze, G.L., Fouotsa, E., El\u00a0Mrabet, N., Pecha, A.: Sage code for the verification of various algorithms\/ formulas and bilinearity of pairings. In: http:\/\/www.emmanuelfouotsa-prmais.org\/Portals\/22\/codeBetaWeil.zip (2021)"},{"key":"531_CR28","doi-asserted-by":"crossref","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 - PKC 2020 - 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, May 4-7, 2020, Proceedings, Part II. Lecture Notes in Computer Science, vol. 12111, pp. 535\u2013564. Springer, (2020)","DOI":"10.1007\/978-3-030-45388-6_19"},{"key":"531_CR29","doi-asserted-by":"crossref","unstructured":"Scott, M., Guillevic, A.: A new family of pairing-friendly elliptic curves. In Budaghyan, L., Rodr\u00edguez-Henr\u00edquez, F. (eds.), Arithmetic of Finite Fields - 7th International Workshop, WAIFI 2018, Bergen, Norway, June 14-16, 2018, Revised Selected Papers, Lecture Notes in Computer Science, vol. 11321, pp. 43\u201357. Springer, (2018)","DOI":"10.1007\/978-3-030-05153-2_2"},{"issue":"4","key":"531_CR30","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 Cryptology 32(4), 1298\u20131336 (2019)","journal-title":"J Cryptology"},{"key":"531_CR31","doi-asserted-by":"crossref","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Constructing elliptic curves with prescribed embedding degrees. In Cimato, S., Galdi, C., Persiano, G. (eds.) Security in Communication Networks, Third International Conference, SCN 2002, Amalfi, Italy, September 11-13, 2002. Revised Papers. Lecture Notes in Computer Science, vol. 2576, pp. 257\u2013267. Springer, (2002)","DOI":"10.1007\/3-540-36413-7_19"},{"key":"531_CR32","doi-asserted-by":"crossref","unstructured":"Enge, A., Milan, J.: Implementing cryptographic pairings at standard security levels. In: Chakraborty, R.S., Matyas, V., Schaumont, P. (eds.) Security, Privacy, and Applied Cryptography Engineering - 4th International Conference, SPACE 2014, Pune, India, October 18-22, 2014. Proceedings, Lecture Notes in Computer Science, vol. 8804, pp. 28\u201346. Springer, (2014)","DOI":"10.1007\/978-3-319-12060-7_3"},{"issue":"9","key":"531_CR33","doi-asserted-by":"publisher","first-page":"2387","DOI":"10.1093\/ietfec\/e91-a.9.2387","volume":"2007","author":"X Lin","year":"2008","unstructured":"Lin, X., Zhao, C., Zhang, F., Wang, Y.: Computing the Ate pairing on elliptic curves with embedding degree k = 9. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 2007(9), 2387\u20132393 (2008)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"531_CR34","doi-asserted-by":"crossref","unstructured":"Costello, C., Lange, T., Naehrig, M.: Faster pairing computations on curves with high-degree twists. In: Public Key Cryptography - PKC 2010, 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010. Proceedings, pp. 224\u2013242, (2010)","DOI":"10.1007\/978-3-642-13013-7_14"},{"issue":"6","key":"531_CR35","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 Cryptogr. 88(6), 1047\u20131081 (2020)","journal-title":"Des. Codes Cryptogr."},{"key":"531_CR36","first-page":"875","volume":"2020","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. J Cryptology ePrint Arch. 2020, 875 (2020)","journal-title":"J Cryptology ePrint Arch."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-022-00531-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11786-022-00531-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-022-00531-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,9]],"date-time":"2022-11-09T16:10:21Z","timestamp":1668010221000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11786-022-00531-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,22]]},"references-count":36,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["531"],"URL":"https:\/\/doi.org\/10.1007\/s11786-022-00531-w","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,22]]},"assertion":[{"value":"15 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"13"}}