{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:31:11Z","timestamp":1743154271247,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031168147"},{"type":"electronic","value":"9783031168154"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16815-4_25","type":"book-chapter","created":{"date-parts":[[2022,9,23]],"date-time":"2022-09-23T20:19:35Z","timestamp":1663964375000},"page":"461-478","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Software Implementation of\u00a0GMT6-672 and\u00a0GMT8-542 Pairing-Friendly Curves for\u00a0a\u00a0128-Bit Security Level"],"prefix":"10.1007","author":[{"given":"Zihao","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junichi","family":"Sakamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeo","family":"Mitsunari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Yoshida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riku","family":"Anzai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsutomu","family":"Matsumoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,24]]},"reference":[{"key":"25_CR1","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":"25_CR2","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical?. In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop (CCSW 2011). Association for Computing Machinery, pp. 113\u2013124 (2011)","DOI":"10.1145\/2046660.2046682"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-70700-6_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"B Abdolmaleki","year":"2017","unstructured":"Abdolmaleki, B., Baghery, K., Lipmaa, H., Zaj\u0105c, M.: A Subversion-Resistant SNARK. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 3\u201333. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_1"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-642-17455-1_26","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"J Boxall","year":"2010","unstructured":"Boxall, J., El Mrabet, N., Laguillaumie, F., Le, D.-P.: A variant of Miller\u2019s formula and algorithm. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol. 6487, pp. 417\u2013434. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17455-1_26"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"PSLM Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319\u2013331. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11693383_22"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-36413-7_19","volume-title":"Security in Communication Networks","author":"PSLM Barreto","year":"2003","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Constructing elliptic curves with prescribed embedding degrees. In: Cimato, S., Persiano, G., Galdi, C. (eds.) SCN 2002. LNCS, vol. 2576, pp. 257\u2013267. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36413-7_19"},{"key":"25_CR7","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"},{"issue":"6","key":"25_CR8","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). https:\/\/doi.org\/10.1007\/s10623-020-00727-w","journal-title":"Des. Codes Crypt."},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-030-97348-3_11","volume-title":"Smart Card Research and Advanced Applications","author":"A Lavice","year":"2021","unstructured":"Lavice, A., Mrabet, N.E., Berzati, A., Rigaud, J., Proy, J.: Hardware implementations of pairings at updated security levels. In: Grosso, V., P\u00f6ppelmann, T. (eds.) CARDIS 2021. LNCS, vol. 13173, pp. 189\u2013209. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-97348-3_11"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-13797-6_13","volume-title":"Arithmetic of Finite Fields","author":"N Benger","year":"2010","unstructured":"Benger, N., Scott, M.: Constructing tower extensions of finite fields for implementation of pairing-based cryptography. In: Hasan, M.A., Helleseth, T. (eds.) WAIFI 2010. LNCS, vol. 6087, pp. 180\u2013195. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13797-6_13"},{"issue":"9","key":"25_CR11","first-page":"2376","volume":"86","author":"Y Nogami","year":"2003","unstructured":"Nogami, Y., Saito, A., Morikawa, Y.: Finite extension field with modulus of all-one polynomial and representation of its elements for fast arithmetic operations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86(9), 2376\u20132387 (2003)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/BFb0055748","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"DV Bailey","year":"1998","unstructured":"Bailey, D.V., Paar, C.: Optimal extension fields for fast arithmetic in public-key algorithms. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 472\u2013485. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055748"},{"key":"25_CR13","unstructured":"Scott, M. (2009): A note on twists for pairing friendly curves. Personal. ftp:\/\/ftp.computing.dcu.ie\/pub\/resources\/crypto\/twists.pdf"},{"key":"25_CR14","unstructured":"Mitsunari, S.: A portable and fast pairing-based cryptographic library. https:\/\/github.com\/herumi\/mcl. Accessed 14 Jan 2021"},{"key":"25_CR15","unstructured":"Nanjo, Y., Kodera, Y., Matsumura, R., Shirase, M., Kusaka, T., Nogami, Y.: Evaluation of a pairing on elliptic curves of embedding degree 15 with type-II all-one polynomial extension field of degree 5. In: 2020 Symposium on Cryptography and Information Security (2020)"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Nanjo, Y., Khandaker, M.M., Kusaka, T, Nogami, Y.: Consideration of efficient pairing applying two construction methods of extension fields. In: 2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW), pp. 445\u2013451 (2018)","DOI":"10.1109\/CANDARW.2018.00087"},{"issue":"1","key":"25_CR17","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1587\/transfun.E92.A.173","volume":"92","author":"H Kato","year":"2009","unstructured":"Kato, H., Nogami, Y., Yoshida, T., Morikawa, Y.: A multiplication algorithm in Fpm such that p\u00bf m with a special class of gauss period normal bases. EICE Trans. Fundam. Electron. Commun. Comput. Sci. 92(1), 173\u2013181 (2009)","journal-title":"EICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"6","key":"25_CR18","doi-asserted-by":"publisher","first-page":"769","DOI":"10.4218\/etrij.07.0107.0040","volume":"29","author":"H Kato","year":"2007","unstructured":"Kato, H., Nogami, Y., Yoshida, T., Morikawa, Y.: Cyclic vector multiplication algorithm based on a special class of Gauss period normal basis. ETRI J. 29(6), 769\u2013778 (2007)","journal-title":"ETRI J."},{"key":"25_CR19","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of many-digital numbers by automatic computers. In: Proceedings of the USSR Academy of Sciences, vol. 145, pp. 595\u2013596 (1963). Translation in the academic journal Physics-Doklady, pp. 293\u2013294"},{"issue":"3","key":"25_CR20","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(3), 362\u2013369 (2005)","journal-title":"IEEE Trans. Comput."},{"key":"25_CR21","unstructured":"Toom, A. L.: The complexity of a scheme of functional elements realizing the multiplication of integers. In: Soviet Mathematics Dok-Lady, vol. 3, no. 4, pp. 714\u2013716 (1963)"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-13013-7_14","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"C Costello","year":"2010","unstructured":"Costello, C., Lange, T., Naehrig, M.: Faster pairing computations on curves with high-degree twists. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 224\u2013242. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_14"},{"key":"25_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-03298-1_7","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"C Costello","year":"2009","unstructured":"Costello, C., Hisil, H., Boyd, C., Gonzalez Nieto, J., Wong, K.K.-H.: Faster pairings on special weierstrass curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 89\u2013101. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03298-1_7"},{"key":"25_CR24","unstructured":"Masson, S.: Cocks-Pinch variant. https:\/\/gitlab.inria.fr\/smasson\/cocks-pinch-variant. Accessed 14 Jan 2021"},{"issue":"281","key":"25_CR25","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)","journal-title":"Math. Comput."},{"key":"25_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-13013-7_13","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"R Granger","year":"2010","unstructured":"Granger, R., Scott, M.: Faster squaring in the cyclotomic subgroup of sixth degree extensions. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 209\u2013223. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_13"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16815-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T13:08:46Z","timestamp":1742044126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16815-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031168147","9783031168154"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16815-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/di.uniroma1.it\/acns2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}