{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T03:40:05Z","timestamp":1749958805710,"version":"3.41.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319531762"},{"type":"electronic","value":"9783319531779"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53177-9_11","type":"book-chapter","created":{"date-parts":[[2017,2,8]],"date-time":"2017-02-08T04:35:07Z","timestamp":1486528507000},"page":"208-219","source":"Crossref","is-referenced-by-count":1,"title":["An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication"],"prefix":"10.1007","author":[{"given":"Md. Al-Amin","family":"Khandaker","sequence":"first","affiliation":[]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[]},{"given":"Yasuyuki","family":"Nogami","sequence":"additional","affiliation":[]},{"given":"Masaaki","family":"Shirase","sequence":"additional","affiliation":[]},{"given":"Sylvain","family":"Duquesne","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,9]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-36334-4_11","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2012","author":"DF Aranha","year":"2013","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. 7708, pp. 177\u2013195. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-36334-4_11"},{"issue":"3","key":"11_CR2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s001450010012","volume":"14","author":"DV Bailey","year":"2001","unstructured":"Bailey, D.V., Paar, C.: Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. J. Crypt. 14(3), 153\u2013176 (2001). http:\/\/dx.doi.org\/10.1007\/s001450010012","journal-title":"J. Crypt."},{"key":"11_CR3","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). doi: 10.1007\/3-540-36413-7_19"},{"key":"11_CR4","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). doi: 10.1007\/11693383_22"},{"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). doi: 10.1007\/3-540-45682-1_30"},{"key":"11_CR6","doi-asserted-by":"crossref","DOI":"10.1201\/9781420034981","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"H Cohen","year":"2005","unstructured":"Cohen, H., Frey, G., Avanzi, R., Doche, C., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, Boca Raton (2005)"},{"issue":"2","key":"11_CR7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s00145-004-0219-7","volume":"18","author":"R Dupont","year":"2005","unstructured":"Dupont, R., Enge, A., Morain, F.: Building curves with arbitrary small MOV degree over finite prime fields. J. Crypt. 18(2), 79\u201389 (2005)","journal-title":"J. Crypt."},{"issue":"2","key":"11_CR8","doi-asserted-by":"crossref","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. Crypt. 23(2), 224\u2013280 (2010)","journal-title":"J. Crypt."},{"key":"11_CR9","unstructured":"Granlund, T.: The GMP development team: GNU MP: The GNU Multiple Precision Arithmetic Library, 6.1.0 edn. (2015). http:\/\/gmplib.org\/"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Algorithmic Number Theory","author":"A Joux","year":"2000","unstructured":"Joux, A.: A one round protocol for tripartite Diffie\u2013Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 385\u2013393. Springer, Heidelberg (2000). doi: 10.1007\/10722028_23"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-85538-5_9","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"EJ Kachisa","year":"2008","unstructured":"Kachisa, E.J., Schaefer, E.F., Scott, M.: Constructing Brezing-Weng pairing-friendly elliptic curves using elements in the cyclotomic field. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 126\u2013135. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-85538-5_9"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Kim, T., Barbulescu, R.: Extended tower number field sieve: A new complexity for medium prime case. Technical report, IACR Cryptology ePrint Archive, 2015: 1027 (2015)","DOI":"10.1007\/978-3-662-53018-4_20"},{"issue":"4","key":"11_CR13","doi-asserted-by":"crossref","first-page":"1793","DOI":"10.1109\/TIT.2009.2013048","volume":"55","author":"E Lee","year":"2009","unstructured":"Lee, E., Lee, H.S., Park, C.M.: Efficient and generalized pairing computation on abelian varieties. IEEE Trans. Inf. Theor. 55(4), 1793\u20131803 (2009)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-77272-9_18","volume-title":"Cryptography and Coding","author":"S Matsuda","year":"2007","unstructured":"Matsuda, S., Kanayama, N., Hess, F., Okamoto, E.: Optimised versions of the ate and twisted ate pairings. In: Galbraith, S.D. (ed.) Cryptography and Coding 2007. LNCS, vol. 4887, pp. 302\u2013312. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-77272-9_18"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-319-04873-4_11","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2013","author":"Y Mori","year":"2014","unstructured":"Mori, Y., Akagi, S., Nogami, Y., Shirase, M.: Pseudo 8\u2013sparse multiplication for efficient ate\u2013based pairing on Barreto\u2013Naehrig curve. In: Cao, Z., Zhang, F. (eds.) Pairing 2013. LNCS, vol. 8365, pp. 186\u2013198. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-04873-4_11"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/11593447_29","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"T Nakanishi","year":"2005","unstructured":"Nakanishi, T., Funabiki, N.: Verifier-local revocation group signature schemes with backward unlinkability from bilinear maps. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 533\u2013548. Springer, Heidelberg (2005). doi: 10.1007\/11593447_29"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Nogami, Y., Akane, M., Sakemi, Y., Katou, H., Morikawa, Y.: Integer variable chi-based ate pairing. In: Proceedings of the Second International Conference on Pairing-Based Cryptography - Pairing 2008, Egham, UK, pp. 178\u2013191, 1\u20133 September 2008. http:\/\/dx.doi.org\/10.1007\/978-3-540-85538-5_13","DOI":"10.1007\/978-3-540-85538-5_13"},{"key":"11_CR18","unstructured":"Sakai, R., Kasahara, M.: ID based cryptosystems with pairing on elliptic curve. IACR Cryptology ePrint Archive 2003, p. 54 (2003)"},{"key":"11_CR19","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., Perez, L.J.D., 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). doi: 10.1007\/978-3-642-03298-1_6"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-72163-5_20","volume-title":"Information Security Practice and Experience","author":"M Shirase","year":"2007","unstructured":"Shirase, M., Takagi, T., Okamoto, E.: Some efficient algorithms for the final exponentiation of $${\\eta _T}$$ pairing. In: Dawson, E., Wong, D.S. (eds.) ISPEC 2007. LNCS, vol. 4464, pp. 254\u2013268. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-72163-5_20"},{"key":"11_CR21","volume-title":"Arithmetic Geometry","author":"JH Silverman","year":"1986","unstructured":"Silverman, J.H., Cornell, G., Artin, M.: Arithmetic Geometry. Springer, Heidelberg (1986)"},{"issue":"1","key":"11_CR22","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F Vercauteren","year":"2010","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Trans. Inf. Theor. 56(1), 455\u2013461 (2010)","journal-title":"IEEE Trans. Inf. Theor."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53177-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T03:13:56Z","timestamp":1749957236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53177-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319531762","9783319531779"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53177-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}