{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:42:25Z","timestamp":1743108145377,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642144226"},{"type":"electronic","value":"9783642144233"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14423-3_4","type":"book-chapter","created":{"date-parts":[[2010,6,18]],"date-time":"2010-06-18T12:13:34Z","timestamp":1276863214000},"page":"47-64","source":"Crossref","is-referenced-by-count":4,"title":["Accelerating Twisted Ate Pairing with Frobenius Map, Small Scalar Multiplication, and Multi-pairing"],"prefix":"10.1007","author":[{"given":"Yumi","family":"Sakemi","sequence":"first","affiliation":[]},{"given":"Shoichi","family":"Takeuchi","sequence":"additional","affiliation":[]},{"given":"Yasuyuki","family":"Nogami","sequence":"additional","affiliation":[]},{"given":"Yoshitaka","family":"Morikawa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Akane, M., Nogami, Y., Morikawa, Y.: Fast Ate Pairing Computation of Embedding Degree 12 Using Subfield\u2013Twisted Elliptic Curve. IEICE Trans. Fundamentals\u00a0E92-A(2) (2009) (to appear)","DOI":"10.1587\/transfun.E92.A.508"},{"key":"4_CR2","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":"P.S.L.M. Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing\u2013Friendly Elliptic Curves of Prime Order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 319\u2013331. Springer, Heidelberg (2006)"},{"key":"4_CR3","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 - 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.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 41\u201355. Springer, Heidelberg (2004)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1007\/11426639_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Boyen, X., Goh, E.-G.: Hierarchical identity based encryption with constant size ciphertext. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 440\u2013456. Springer, Heidelberg (2005)"},{"key":"4_CR6","volume-title":"GTM","author":"H. Cohen","year":"1993","unstructured":"Cohen, H.: A course in computational algebraic number theory. In: GTM, vol.\u00a0139. Springer, Heidelberg (1993)"},{"key":"4_CR7","volume-title":"Discrete Mathematics and Its Applications","author":"H. Cohen","year":"2005","unstructured":"Cohen, H., Frey, G.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. In: Discrete Mathematics and Its Applications. Chapman & Hall CRC, Boca Raton (2005)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-73489-5_10","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"A.J. Devegili","year":"2007","unstructured":"Devegili, A.J., Scott, M., Dahab, R.: Implementing Cryptographic Pairings over Barreto-Naehrig Curves. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol.\u00a04575, pp. 197\u2013207. Springer, Heidelberg (2007)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/11792086_32","volume-title":"Algorithmic Number Theory","author":"D. Freeman","year":"2006","unstructured":"Freeman, D.: Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 452\u2013465. Springer, Heidelberg (2006)"},{"key":"4_CR10","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. preprint (2006), \n                      http:\/\/math.berkeley.edu\/~dfreeman\/papers\/taxonomy.pdf"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-85538-5_15","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"S.D. Galbraith","year":"2008","unstructured":"Galbraith, S.D., Scott, M.: Exponentiation in pairing-friendly groups using homomorphisms. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 211\u2013224. Springer, Heidelberg (2008)"},{"key":"4_CR12","unstructured":"GNU MP, \n                      http:\/\/gmplib.org\/"},{"key":"4_CR13","unstructured":"Granger, R., Smart, N.P.: On computing products of pairings. Cryptology ePrint Archive: Report 2006\/172"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-04159-4_3","volume-title":"Selected Areas in Cryptography","author":"P. Grabher","year":"2009","unstructured":"Grabher, P., Gro\u00dfsch\u00e4dl, J., Page, D.: On Software Parallel Implementation of Cryptographic Pairings. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol.\u00a05381, pp. 34\u201339. Springer, Heidelberg (2009)"},{"key":"4_CR15","volume-title":"Identity\u2013Based Cryptography","author":"D. Hankerson","year":"2008","unstructured":"Hankerson, D., Menezes, A., Scott, M.: Software Implementation of Pairings. In: Identity\u2013Based Cryptography, IOS Press, Amsterdam (2008), \n                      http:\/\/www.math.uwaterloo.ca\/~ajmeneze\/research.html"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Hess, F., Smart, N., Vercauteren, F.: The Eta Pairing Revisited. IEEE Trans. Information Theory, 4595\u20134602 (2006)","DOI":"10.1109\/TIT.2006.881709"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","volume":"78","author":"T. Itoh","year":"1988","unstructured":"Itoh, T., Tsujii, S.: A Fast Algorithm for Computing Multiplicative Inverses in GF(2\n                    m\n                  ) Using Normal Bases. Inf. and Comp.\u00a078, 171\u2013177 (1988)","journal-title":"Inf. and Comp."},{"issue":"6","key":"4_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 Journal\u00a029(6), 769\u2013778 (2007), \n                      http:\/\/etrij.etri.re.kr\/Cyber\/servlet\/BrowseAbstract?paperid=RP0702-0040","journal-title":"ETRI Journal"},{"key":"4_CR19","volume-title":"The Art of Computer Programming: Seminumerical Algorithms","author":"D. Knuth","year":"1981","unstructured":"Knuth, D.: The Art of Computer Programming: Seminumerical Algorithms, vol.\u00a02. Addison-Wesley, Reading (1981)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Lee, E., Lee, H., Park, C.: Efficient and Generalized Pairing Computation on Abelien Varieties. To appear in IEEE transactions on Information Theory (2009)","DOI":"10.1109\/TIT.2009.2013048"},{"key":"4_CR21","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.\u00a04887, pp. 302\u2013312. Springer, Heidelberg (2007)"},{"key":"4_CR22","unstructured":"Mitsunari, S.: A Fast Implementation of \u03b7\n                           \n                    T\n                   Pairing in Characteristic Three on Intel Core 2 Duo Processor. IACR ePrint archive, 2009\/032.pdf"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","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.\u00a03788, pp. 443\u2013454. Springer, Heidelberg (2005)"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-540-85538-5_13","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"Y. Nogami","year":"2008","unstructured":"Nogami, Y., Akane, M., Sakemi, Y., Kato, H., Morikawa, Y.: Integer Variable \u03c7\u2013based Ate Pairing. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 178\u2013191. Springer, Heidelberg (2008)"},{"issue":"2","key":"4_CR25","first-page":"73","volume":"37","author":"Y. Nogami","year":"2003","unstructured":"Nogami, Y., Morikawa, Y.: A Fast Implementation of Elliptic Curve Cryptosystem with Prime Order Defined over $F_{p^{8}}$. Memoirs of the Faculty of Engineering Okayama University\u00a037(2), 73\u201388 (2003)","journal-title":"Memoirs of the Faculty of Engineering Okayama University"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-89641-8_16","volume-title":"Cryptology and Network Security","author":"Y. Sakemi","year":"2008","unstructured":"Sakemi, Y., Nogami, Y., Okeya(Hitachi), K., Kato, H., Morikawa, Y.: Skew Frobenius Map and Efficient Scalar Multiplication for Pairing-based Cryptography. In: Franklin, M.K., Hui, L.C.K., Wong, D.S. (eds.) CANS 2008. LNCS, vol.\u00a05339, pp. 226\u2013239. Springer, Heidelberg (2008)"},{"key":"4_CR27","unstructured":"Vercauteren, F.: Optimal Pairings. IACR ePrint archive, \n                      http:\/\/eprint.iacr.org\/2008\/096"}],"container-title":["Lecture Notes in Computer Science","Information, Security and Cryptology \u2013 ICISC 2009"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14423-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T03:23:46Z","timestamp":1676690626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14423-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144226","9783642144233"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14423-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}