{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T18:39:17Z","timestamp":1777660757255,"version":"3.51.4"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,3,7]],"date-time":"2020-03-07T00:00:00Z","timestamp":1583539200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,7]],"date-time":"2020-03-07T00:00:00Z","timestamp":1583539200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10623-020-00727-w","type":"journal-article","created":{"date-parts":[[2020,3,7]],"date-time":"2020-03-07T10:02:55Z","timestamp":1583575375000},"page":"1047-1081","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Cocks\u2013Pinch curves of embedding degrees five to eight and optimal ate pairing computation"],"prefix":"10.1007","volume":"88","author":[{"given":"Aurore","family":"Guillevic","sequence":"first","affiliation":[]},{"given":"Simon","family":"Masson","sequence":"additional","affiliation":[]},{"given":"Emmanuel","family":"Thom\u00e9","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,7]]},"reference":[{"key":"727_CR1","doi-asserted-by":"publisher","unstructured":"Aoki K., Franke J., Kleinjung T., Lenstra A.K., Osvik D.A.: A kilobit special number field sieve factorization. In: Kurosawa K. (ed.) ASIACRYPT\u00a02007. LNCS, vol.\u00a04833, pp. 1\u201312. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76900-2_1.","DOI":"10.1007\/978-3-540-76900-2_1"},{"key":"727_CR2","unstructured":"Aranha D.F.: Pairings are not dead, just resting. Slides at ECC 2017 workshop. (2017). https:\/\/ecc2017.cs.ru.nl\/."},{"key":"727_CR3","doi-asserted-by":"publisher","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 2012. LNCS, vol.\u00a07708, pp. 177\u2013195. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36334-4_11.","DOI":"10.1007\/978-3-642-36334-4_11"},{"key":"727_CR4","unstructured":"Aranha D.F., Gouv\u00eaa C.P.L.: RELIC is an Efficient LIbrary for Cryptography. https:\/\/github.com\/relic-toolkit\/relic."},{"key":"727_CR5","doi-asserted-by":"publisher","unstructured":"Aranha D.F., Karabina K., Longa P., Gebotys C.H., L\u00f3pez-Hern\u00e1ndez J.C.: Faster explicit formulas for computing pairings over ordinary curves. In: Paterson, K.G. (ed.) EUROCRYPT\u00a02011. LNCS, vol.\u00a06632, pp. 48\u201368. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_5.","DOI":"10.1007\/978-3-642-20465-4_5"},{"key":"727_CR6","unstructured":"Bai S., Gaudry P., Kruppa A., Thom\u00e9 E., Zimmermann P.: Factorization of RSA-220. Number Theory list (May 12 2016), https:\/\/listserv.nodak.edu\/cgi-bin\/wa.exe?A2=NMBRTHRY;d17fe291.1605, http:\/\/www.loria.fr\/~zimmerma\/papers\/rsa220.pdf."},{"issue":"4","key":"727_CR7","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. 32(4), 1298\u20131336 (2019). https:\/\/doi.org\/10.1007\/s00145-018-9280-5.","journal-title":"J. Cryptol."},{"key":"727_CR8","doi-asserted-by":"publisher","unstructured":"Barbulescu R., Gaudry P., Guillevic A., Morain F.: Improving NFS for the discrete logarithm problem in non-prime finite fields. In: Oswald E., Fischlin M. (eds.) EUROCRYPT\u00a02015, Part\u00a0I. LNCS, vol.\u00a09056, pp. 129\u2013155. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_6.","DOI":"10.1007\/978-3-662-46800-5_6"},{"key":"727_CR9","doi-asserted-by":"publisher","unstructured":"Barbulescu R., Gaudry P., Kleinjung T.: The tower number field sieve. In: Iwata T., Cheon J.H. (eds.) ASIACRYPT\u00a02015, Part\u00a0II. LNCS, vol.\u00a09453, pp. 31\u201355. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_2.","DOI":"10.1007\/978-3-662-48800-3_2"},{"key":"727_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.E., Rodr\u00edguez-Henr\u00edquez F. (eds.) LATINCRYPT\u00a02015. LNCS, vol.\u00a09230, pp. 245\u2013265. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-22174-8_14.","DOI":"10.1007\/978-3-319-22174-8_14"},{"key":"727_CR11","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: Goldwasser, S. (ed.) ITCS 2012. pp. 326\u2013349. ACM (Jan 2012). https:\/\/doi.org\/10.1145\/2090236.2090263","DOI":"10.1145\/2090236.2090263"},{"key":"727_CR12","doi-asserted-by":"publisher","unstructured":"Boneh D., Franklin M.K.: Identity-based encryption from the Weil pairing. In: Kilian J. (ed.) CRYPTO\u00a02001. LNCS, vol.\u00a02139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13.","DOI":"10.1007\/3-540-44647-8_13"},{"key":"727_CR13","doi-asserted-by":"publisher","unstructured":"Boneh D., Lynn B., Shacham H.: Short signatures from the Weil pairing. In: Boyd C. (ed.) ASIACRYPT\u00a02001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30.","DOI":"10.1007\/3-540-45682-1_30"},{"key":"727_CR14","unstructured":"Bouvier C., Gaudry P., Imbert L., Jeljeli H., Thom\u00e9 E.: Discrete logarithms in GF$$(p)$$\u2014180 digits. Number Theory list, item 004703 (2014). https:\/\/listserv.nodak.edu\/cgi-bin\/wa.exe?A2=NMBRTHRY;615d922a.1406."},{"key":"727_CR15","unstructured":"Bowe S.: BLS12-381: New zk-SNARK elliptic curve construction. Zcash blog (2017). https:\/\/blog.z.cash\/new-snark-curve\/."},{"issue":"6","key":"727_CR16","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1109\/TC.2016.2633340","volume":"66","author":"S Chatterjee","year":"2017","unstructured":"Chatterjee S., Menezes A., Rodr\u00edguez-Henr\u00edquez F.: On instantiating pairing-based protocols with elliptic curves of embedding degree one. IEEE Trans. Comput. 66(6), 1061\u20131070 (2017). https:\/\/doi.org\/10.1109\/TC.2016.2633340.","journal-title":"IEEE Trans. Comput."},{"key":"727_CR17","unstructured":"Childers G.: Factorization of a 1061-bit number by the special number field sieve. Cryptology ePrint Archive, Report 2012\/444 (2012). http:\/\/eprint.iacr.org\/2012\/444."},{"key":"727_CR18","doi-asserted-by":"publisher","unstructured":"Chuengsatiansup C., Martindale C.: Pairing-friendly twisted hessian curves. In: Chakraborty D., Iwata T. (eds.) INDOCRYPT\u00a02018. LNCS, vol. 11356, pp. 228\u2013247. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-05378-9_13.","DOI":"10.1007\/978-3-030-05378-9_13"},{"key":"727_CR19","doi-asserted-by":"publisher","unstructured":"Chung J., Hasan M.A.: Asymmetric squaring formulae. In: 18th IEEE Symposium on Computer Arithmetic (ARITH \u201907). pp. 113\u2013122 (2007). https:\/\/doi.org\/10.1109\/ARITH.2007.11.","DOI":"10.1109\/ARITH.2007.11"},{"key":"727_CR20","doi-asserted-by":"publisher","unstructured":"Cohen H., Miyaji A., Ono T.: Efficient elliptic curve exponentiation using mixed coordinates. In: Ohta K., Pei D. (eds.) ASIACRYPT\u201998. LNCS, vol.\u00a01514, pp. 51\u201365. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49649-1_6.","DOI":"10.1007\/3-540-49649-1_6"},{"key":"727_CR21","doi-asserted-by":"publisher","unstructured":"Costello C., Lange T., Naehrig M.: Faster pairing computations on curves with high-degree twists. In: Nguyen P.Q., Pointcheval D. (eds.) PKC\u00a02010. LNCS, vol.\u00a06056, pp. 224\u2013242. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_14.","DOI":"10.1007\/978-3-642-13013-7_14"},{"key":"727_CR22","unstructured":"Devegili A.J., \u00d3\u00a0h\u00c9igeartaigh C., Scott M., Dahab R.: Multiplication and squaring on pairing-friendly fields. Cryptology ePrint Archive, Report 2006\/471 (2006). http:\/\/eprint.iacr.org\/2006\/471."},{"issue":"4","key":"727_CR23","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). https:\/\/doi.org\/10.1515\/jmc-2013-0033.","journal-title":"J. Math. Cryptol."},{"key":"727_CR24","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. Theroretical Comput. Sci. 800, 73\u201389 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.10.017.","journal-title":"Theroretical Comput. Sci."},{"key":"727_CR25","unstructured":"Fotiadis G., Martindale C.: Optimal TNFS-secure pairings on elliptic curves with even embedding degree. Cryptology ePrint Archive, Report 2018\/969 (2018). https:\/\/eprint.iacr.org\/2018\/969."},{"issue":"2","key":"727_CR26","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). https:\/\/doi.org\/10.1007\/s00145-009-9048-z.","journal-title":"J. Cryptol."},{"key":"727_CR27","doi-asserted-by":"publisher","unstructured":"Fried J., Gaudry P., Heninger N., Thom\u00e9 E.: A kilobit hidden SNFS discrete logarithm computation. In: Coron J., Nielsen J.B. (eds.) EUROCRYPT\u00a02017, Part\u00a0I. LNCS, vol. 10210, pp. 202\u2013231. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_8.","DOI":"10.1007\/978-3-319-56620-7_8"},{"key":"727_CR28","doi-asserted-by":"publisher","unstructured":"Gordon D.M.: Designing and detecting trapdoors for discrete log cryptosystems. In: Brickell E.F. (ed.) CRYPTO\u201992. LNCS, vol.\u00a0740, pp. 66\u201375. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_5.","DOI":"10.1007\/3-540-48071-4_5"},{"key":"727_CR29","doi-asserted-by":"publisher","unstructured":"Granger R., Scott M.: Faster squaring in the cyclotomic subgroup of sixth degree extensions. In: Nguyen P.Q., Pointcheval D. (eds.) PKC\u00a02010. LNCS, vol.\u00a06056, pp. 209\u2013223. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_13.","DOI":"10.1007\/978-3-642-13013-7_13"},{"key":"727_CR30","unstructured":"Guillevic A.: Simulating DL computation in $${{\\rm GF}}(p^n)$$ with the new variants of the Tower-NFS algorithm to deduce security level estimates (2017). Slides at ECC 2017 workshop. https:\/\/ecc2017.cs.ru.nl\/."},{"issue":"4","key":"727_CR31","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). https:\/\/doi.org\/10.1007\/s00145-004-0312-y.","journal-title":"J. Cryptol."},{"issue":"242","key":"727_CR32","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1090\/S0025-5718-02-01482-5","volume":"72","author":"A Joux","year":"2003","unstructured":"Joux A., Lercier R.: Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the Gaussian integer method. Math. Comput. 72(242), 953\u2013967 (2003). https:\/\/doi.org\/10.1090\/S0025-5718-02-01482-5.","journal-title":"Math. Comput."},{"key":"727_CR33","doi-asserted-by":"publisher","unstructured":"Joux A., Pierrot C.: The special number field sieve in $$\\mathbb{F}_{p^n}$$\u2014application to pairing-friendly constructions. In: Cao Z., Zhang F. (eds.) PAIRING 2013. LNCS, vol.\u00a08365, pp. 45\u201361. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-319-04873-4_3.","DOI":"10.1007\/978-3-319-04873-4_3"},{"issue":"281","key":"727_CR34","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1090\/S0025-5718-2012-02625-1","volume":"82","author":"K Karabina","year":"2013","unstructured":"Karabina K.: Squaring in cyclotomic subgroups. Math. Comput. 82(281), 555\u2013579 (2013). https:\/\/doi.org\/10.1090\/S0025-5718-2012-02625-1.","journal-title":"Math. Comput."},{"key":"727_CR35","doi-asserted-by":"publisher","unstructured":"Khandaker M.A.A., Nanjo Y., Ghammam L., Duquesne S., Nogami Y.,Kodera Y.: Efficient optimal ate pairing at 128-bit security level. In: Patra A., Smart N.P. (eds.) INDOCRYPT\u00a02017. LNCS, vol.10698, pp. 186\u2013205. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-71667-1_10","DOI":"10.1007\/978-3-319-71667-1_10"},{"key":"727_CR36","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.) CRYPTO\u00a02016, Part\u00a0I. LNCS, vol.\u00a09814, pp. 543\u2013571. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_20.","DOI":"10.1007\/978-3-662-53018-4_20"},{"key":"727_CR37","doi-asserted-by":"publisher","unstructured":"Kiyomura Y., Inoue A., Kawahara Y., Yasuda M., Takagi T., Kobayashi T.: Secure and efficient pairing at 256-bit security level. In: Gollmann D., Miyaji A., Kikuchi H. (eds.) ACNS 17. LNCS, vol. 10355, pp. 59\u201379. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_4.","DOI":"10.1007\/978-3-319-61204-1_4"},{"key":"727_CR38","doi-asserted-by":"publisher","unstructured":"Kleinjung T., Aoki K., Franke J., Lenstra A.K., Thom\u00e9 E., Bos J.W., Gaudry P., Kruppa A., Montgomery P.L., Osvik D.A., te\u00a0Riele H.J.J., Timofeev A., Zimmermann P.: Factorization of a 768-bit RSA modulus. In: Rabin T. (ed.) CRYPTO\u00a02010. LNCS, vol.\u00a06223, pp. 333\u2013350. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_18.","DOI":"10.1007\/978-3-642-14623-7_18"},{"key":"727_CR39","doi-asserted-by":"publisher","unstructured":"Kleinjung T., Diem C., Lenstra A.K., Priplata C., Stahlke C.: Computation of a 768-bit prime field discrete logarithm. In: Coron J., Nielsen J.B. (eds.) EUROCRYPT\u00a02017, Part\u00a0I. LNCS, vol. 10210, pp. 185\u2013201. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_7.","DOI":"10.1007\/978-3-319-56620-7_7"},{"key":"727_CR40","doi-asserted-by":"publisher","unstructured":"Lewko A.B.: Tools for simulating features of composite order bilinear groups in the prime order setting. In: Pointcheval D., Johansson T. (eds.) EUROCRYPT\u00a02012. LNCS, vol.\u00a07237, pp. 318\u2013335. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_20.","DOI":"10.1007\/978-3-642-29011-4_20"},{"key":"727_CR41","doi-asserted-by":"publisher","unstructured":"Li L., Wu H., Zhang F.: Pairing computation on edwards curves with high-degree twists. In: Lin D., Xu S., Yung M. (eds.) Inscrypt, LNCS, vol.\u00a08567, pp. 185\u2013200. Springer, Guangzhou, China (2013). https:\/\/doi.org\/10.1007\/978-3-319-12087-4_12.","DOI":"10.1007\/978-3-319-12087-4_12"},{"key":"727_CR42","doi-asserted-by":"publisher","unstructured":"Menezes A., Sarkar P., Singh S.: Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography. In: Phan R.C., Yung M. (eds.) Mycrypt Conference, LNCS, vol. 10311, pp. 83\u2013108. Springer, Kuala Lumpur (2016). https:\/\/doi.org\/10.1007\/978-3-319-61273-7_5.","DOI":"10.1007\/978-3-319-61273-7_5"},{"key":"727_CR43","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/TC.2005.49","volume":"54","author":"PL Montgomery","year":"2005","unstructured":"Montgomery P.L.: Five, six, and seven-term Karatsuba-like formulae. IEEE Trans. Comput. 54, 362\u2013369 (2005). https:\/\/doi.org\/10.1109\/TC.2005.49.","journal-title":"IEEE Trans. Comput."},{"key":"727_CR44","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Technology: Recommendation Key Management (part 1: General); SP 800-57 Part 1, fourth revision (2016). https:\/\/doi.org\/10.6028\/NIST.SP.800-57pt1r4.","DOI":"10.6028\/NIST.SP.800-57pt1r4"},{"issue":"8","key":"727_CR45","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1016\/j.jss.2011.03.083","volume":"84","author":"GC Pereira","year":"2011","unstructured":"Pereira G.C., Simpl\u00edcio M.A., Naehrig M., Barreto P.S.: A family of implementation-friendly BN elliptic curves. J. Syst. Softw. 84(8), 1319\u20131326 (2011). https:\/\/doi.org\/10.1016\/j.jss.2011.03.083.","journal-title":"J. Syst. Softw."},{"key":"727_CR46","doi-asserted-by":"publisher","unstructured":"Sarkar P., Singh S.: A general polynomial selection method and new asymptotic complexities for the tower number field sieve algorithm. In: Cheon J.H., Takagi T. (eds.) ASIACRYPT\u00a02016, Part\u00a0I. LNCS, vol. 10031, pp. 37\u201362. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_2.","DOI":"10.1007\/978-3-662-53887-6_2"},{"issue":"269","key":"727_CR47","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1090\/S0025-5718-09-02198-X","volume":"79","author":"O Schirokauer","year":"2010","unstructured":"Schirokauer O.: The number field sieve for integers of low weight. Math. Comput. 79(269), 583\u2013602 (2010). https:\/\/doi.org\/10.1090\/S0025-5718-09-02198-X.","journal-title":"Math. Comput."},{"key":"727_CR48","doi-asserted-by":"publisher","unstructured":"Scott M.: Implementing cryptographic pairings (invited talk). In: Takagi T., Okamoto T., Okamoto E., Okamoto T. (eds.) PAIRING 2007. LNCS, vol.\u00a04575, pp. 177\u2013196. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73489-5.","DOI":"10.1007\/978-3-540-73489-5"},{"issue":"737","key":"727_CR49","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1090\/S0025-5718-00-01308-9","volume":"71","author":"IA Semaev","year":"2002","unstructured":"Semaev I.A.: Special prime numbers and discrete logs in finite prime fields. Math. Comput. 71(737), 363\u2013377 (2002). https:\/\/doi.org\/10.1090\/S0025-5718-00-01308-9.","journal-title":"Math. Comput."},{"key":"727_CR50","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1112\/S1461157012001015","volume":"15","author":"AV Sutherland","year":"2012","unstructured":"Sutherland A.V.: Accelerating the CM method. LMS J. Comput. Math. 15, 172\u2013204 (2012). https:\/\/doi.org\/10.1112\/S1461157012001015.","journal-title":"LMS J. Comput. Math."},{"key":"727_CR51","doi-asserted-by":"publisher","unstructured":"Tanaka S., Nakamula K.: Constructing pairing-friendly elliptic curves using factorization of cyclotomic polynomials. In: Galbraith S.D., Paterson K.G. (eds.) PAIRING 2008. LNCS, vol.\u00a05209, pp. 136\u2013145. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85538-5_10.","DOI":"10.1007\/978-3-540-85538-5_10"},{"issue":"1","key":"727_CR52","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. Inform. Theory 56(1), 455\u2013461 (2010). https:\/\/doi.org\/10.1109\/TIT.2009.2034881.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"727_CR53","doi-asserted-by":"publisher","unstructured":"Weber D., Denny T.F.: The solution of McCurley\u2019s discrete log challenge. In: Krawczyk H. (ed.) CRYPTO\u201998. LNCS, vol.\u00a01462, pp. 458\u2013471. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055747.","DOI":"10.1007\/BFb0055747"},{"key":"727_CR54","doi-asserted-by":"publisher","unstructured":"Zhang X., Lin D.: Analysis of optimum pairing products at high security levels. In: Galbraith S.D., Nandi M. (eds.) INDOCRYPT\u00a02012. LNCS, vol.\u00a07668, pp. 412\u2013430. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34931-7_24.","DOI":"10.1007\/978-3-642-34931-7_24"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00727-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-020-00727-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00727-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,7]],"date-time":"2021-03-07T00:54:29Z","timestamp":1615078469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-020-00727-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,7]]},"references-count":54,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["727"],"URL":"https:\/\/doi.org\/10.1007\/s10623-020-00727-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,7]]},"assertion":[{"value":"29 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}