{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T01:56:47Z","timestamp":1783562207735,"version":"3.55.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T00:00:00Z","timestamp":1676505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T00:00:00Z","timestamp":1676505600000},"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,3]]},"DOI":"10.1007\/s00200-023-00596-5","type":"journal-article","created":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T06:29:06Z","timestamp":1676528946000},"page":"153-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["x-superoptimal pairings on elliptic curves with odd prime embedding degrees: BW13-P310 and BW19-P286"],"prefix":"10.1007","volume":"36","author":[{"given":"Emmanuel","family":"Fouotsa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurian Azebaze","family":"Guimagang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Raoul","family":"Ayissi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,2,16]]},"reference":[{"key":"596_CR1","doi-asserted-by":"crossref","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Advances in Cryptology - EUROCRYPT 2003, International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 4\u20138, 2003, Proceedings, pp. 416\u2013432, (2003)","DOI":"10.1007\/3-540-39200-9_26"},{"key":"596_CR2","doi-asserted-by":"crossref","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the weil pairing. In: Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19\u201323, 2001, Proceedings, pp. 213\u2013229, (2001)","DOI":"10.1007\/3-540-44647-8_13"},{"issue":"4","key":"596_CR3","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. Cryptol. 17(4), 297\u2013319 (2004)","journal-title":"J. Cryptol."},{"issue":"5","key":"596_CR4","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1109\/TC.2018.2878829","volume":"68","author":"G Zanon","year":"2019","unstructured":"Zanon, G., Simpl\u00edcio, M.A., Jr., Pereira, G.C.C.F., Doliskani, J., Barreto, P.S.L.M.: Faster key compression for isogeny-based cryptosystems. IEEE Trans. Comput. 68(5), 688\u2013701 (2019)","journal-title":"IEEE Trans. Comput."},{"key":"596_CR5","doi-asserted-by":"crossref","unstructured":"Feo, L.D., Masson, S., Petit, C., Sanso, A.: Verifiable delay functions from supersingular isogenies and pairings. In Steven\u00a0D.G., Shiho M., eds. Advances in Cryptology - ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8\u201312, 2019, Proceedings, Part I, volume 11921 of Lecture Notes in Computer Science, pp. 248\u2013277. Springer, (2019)","DOI":"10.1007\/978-3-030-34578-5_10"},{"issue":"1","key":"596_CR6","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":"596_CR7","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, volume 281 of Applied Mechanics and Materials, pp. 127\u2013133. Trans Tech Publications Ltd, 3 (2013)","DOI":"10.4028\/www.scientific.net\/AMM.281.127"},{"key":"596_CR8","doi-asserted-by":"crossref","unstructured":"Kim, T., Barbulescu, R.: Extended tower number field sieve: A new complexity for the medium prime case. In: Matthew, R., Jonathan, K., eds. Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14\u201318, 2016, Proceedings, Part I, volume 9814 of Lecture Notes in Computer Science, pp. 543\u2013571. Springer, (2016)","DOI":"10.1007\/978-3-662-53018-4_20"},{"key":"596_CR9","doi-asserted-by":"crossref","unstructured":"Clarisse, R., Duquesne, S., Sanders, O.: Curves with fast computations in the first pairing group. In: Stephan, K., Haya, S., Serge, V., eds. Cryptology and Network Security - 19th International Conference, CANS 2020, Vienna, Austria, December 14\u201316, 2020, Proceedings, volume 12579 of Lecture Notes in Computer Science, pp. 280\u2013298. Springer, (2020)","DOI":"10.1007\/978-3-030-65411-5_14"},{"issue":"3","key":"596_CR10","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1109\/TDSC.2011.63","volume":"9","author":"E Brickell","year":"2012","unstructured":"Brickell, E., Li, J.: Enhanced privacy ID: A direct anonymous attestation scheme with enhanced revocation capabilities. IEEE Trans. Dependable Secur. Comput. 9(3), 345\u2013360 (2012)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"596_CR11","doi-asserted-by":"crossref","unstructured":"Rivest, R.L., Shamir, A., Tauman, Y.: How to leak a secret. In: Colin, B., ed. Advances in Cryptology - ASIACRYPT 2001, 7th International Conference on the Theory and Application of Cryptology and Information Security, Gold Coast, Australia, December 9-13, 2001, Proceedings, volume 2248 of Lecture Notes in Computer Science, pp. 552\u2013565. Springer, (2001)","DOI":"10.1007\/3-540-45682-1_32"},{"issue":"5","key":"596_CR12","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1587\/transfun.2021EAP1115","volume":"105","author":"Y Dai","year":"2022","unstructured":"Dai, Y., Zhou, Z., Zhang, F., Zhao, C.: Software implementation of optimal pairings on elliptic curves with odd prime embedding degrees. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105(5), 858\u2013870 (2022)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"596_CR13","unstructured":"Dai, Y., Zhang, F., Zhao, C.: Fast hashing to $$\\mathbb{G}_{2}$$ in direct anonymous attestation. In: Cryptology ePrint Archive, pp. 996, (2022)"},{"key":"596_CR14","unstructured":"Barreto, P.S.L.M., et al. :Efficient algorithms for pairing-based cryptosystems. In: Moti, Y., ed. Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18\u201322, 2002, Proceedings, volume 2442 of Lecture Notes in Computer Science, pp. 354\u2013368. Springer, (2002)"},{"issue":"2","key":"596_CR15","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":"596_CR16","unstructured":"Barbulescu, R., El Mrabet, N., Ghammam, L.: A taxonomy of pairings, their security, their complexity. IACR Cryptol. ePrint Arch., 485, (2019)"},{"key":"596_CR17","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., et al. eds. Public-Key Cryptography - PKC 2020 - 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, May 4\u20137, 2020, Proceedings, Part II, volume 12111 of Lecture Notes in Computer Science, pp. 535\u2013564. Springer, (2020)","DOI":"10.1007\/978-3-030-45388-6_19"},{"key":"596_CR18","unstructured":"Laurian, A,G., Fouotsa, E., Ayissi, R.: Magma code for the verification of various algorithms\/formulas and bilinearity of pairings (2022). http:\/\/www.emmanuelfouotsa-prmais.org\/Portals\/22\/codeXsuperopt"},{"issue":"6","key":"596_CR19","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":"596_CR20","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.ins.2014.12.019","volume":"300","author":"Kyung-Ah Shim","year":"2015","unstructured":"Shim, Kyung-Ah.: An efficient ring signature scheme from pairings. Inf. Sci. 300, 63\u201369 (2015)","journal-title":"Inf. Sci."},{"key":"596_CR21","unstructured":"Minkowski, H.: Geometrie der Zahlen, volume Druck und Verlag von B.G. Teubner. Leipzig und Berlin, (1910)"},{"issue":"1","key":"596_CR22","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10623-004-3808-4","volume":"37","author":"F Brezing","year":"2005","unstructured":"Brezing, F., Weng, A.: Elliptic curves suitable for pairing based cryptography. Des. Codes Cryptogr. 37(1), 133\u2013141 (2005)","journal-title":"Des. Codes Cryptogr."}],"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-00596-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-023-00596-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-023-00596-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T14:31:39Z","timestamp":1738679499000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-023-00596-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,16]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["596"],"URL":"https:\/\/doi.org\/10.1007\/s00200-023-00596-5","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,16]]},"assertion":[{"value":"22 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}