{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:42:21Z","timestamp":1725540141074},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642054433"},{"type":"electronic","value":"9783642054457"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05445-7_23","type":"book-chapter","created":{"date-parts":[[2009,11,3]],"date-time":"2009-11-03T10:03:23Z","timestamp":1257242603000},"page":"364-375","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Residue Group Multiplication for the \u03b7 T Pairing over ${\\mathbb F}_{3^m}$"],"prefix":"10.1007","author":[{"given":"Yuta","family":"Sasaki","sequence":"first","affiliation":[]},{"given":"Satsuki","family":"Nishina","sequence":"additional","affiliation":[]},{"given":"Masaaki","family":"Shirase","sequence":"additional","affiliation":[]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"23_CR1","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"P. Barreto","year":"2007","unstructured":"Barreto, P., Galbraith, S., O\u2019hEigeartaigh, C., Scott, S.: Efficient pairing computation on supersingular Abelian varieties. Designs, Codes and Cryptography\u00a042(3), 239\u2013271 (2007)","journal-title":"Designs, Codes and Cryptography"},{"key":"23_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. Barreto","year":"2006","unstructured":"Barreto, P., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 319\u2013331. Springer, Heidelberg (2006)"},{"issue":"11","key":"23_CR3","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1109\/TC.2008.103","volume":"57","author":"J.-L. Beuchat","year":"2008","unstructured":"Beuchat, J.-L., Brisebarre, N., Detrey, J., Okamoto, E., Shirase, M., Takagi, T.: Algorithms and arithmetic operators for computing the \u03b7\n                  \n                    T\n                   pairing in characteristic three. IEEE Transactions on Computers\u00a057(11), 1454\u20131468 (2008)","journal-title":"IEEE Transactions on Computers"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-540-73074-3_10","volume-title":"Arithmetic of Finite Fields","author":"M. Bodrato","year":"2007","unstructured":"Bodrato, M.: Towards optimal Toom-Cook multiplication for univariate and multivariate polynomials in characteristic 2 and 0. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol.\u00a04547, pp. 116\u2013133. Springer, Heidelberg (2007)"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 506\u2013522. Springer, Heidelberg (2004)"},{"issue":"3","key":"23_CR6","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.: Identity based encryption from the Weil pairing. SIAM Journal of Computing\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM Journal of Computing"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/11535218_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 258\u2013275. Springer, Heidelberg (2005)"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-79456-1_10","volume-title":"Algorithmic Number Theory","author":"R. Brent","year":"2008","unstructured":"Brent, R., Gaudry, P., Thom\u00e9, E., Zimmermann, P.: Faster multiplication in GF(2)[x]. In: van der Poorten, A.J., Stein, A. (eds.) ANTS-VIII 2008. LNCS, vol.\u00a05011, pp. 153\u2013166. Springer, Heidelberg (2008)"},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0097-3165(89)90020-4","volume":"50","author":"D. Cantor","year":"1989","unstructured":"Cantor, D.: On arithmetical algorithms over finite fields. J. Combinatorial Theory, Series A-50, 285\u2013300 (1989)","journal-title":"J. Combinatorial Theory, Series A-"},{"key":"23_CR10","unstructured":"Cook, S.: On the minimum computation time of functions. PhD thesis, Harvard University (1966)"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-77360-3_12","volume-title":"Selected Areas in Cryptography","author":"E. Gorla","year":"2007","unstructured":"Gorla, E., Puttmann, C., Shokrollahi, J.: Explicit formulas for efficient multiplication in \n                    \n                      \n                    \n                    $\\mathbb F_{3^{6m}}$\n                  . In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol.\u00a04876, pp. 173\u2013183. Springer, Heidelberg (2007)"},{"key":"23_CR12","first-page":"595","volume":"7","author":"A. Karatsuba","year":"1963","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers on automata. Soviet Physics-Doklady\u00a07, 595\u2013596 (1963)","journal-title":"Soviet Physics-Doklady"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/11545262_30","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"T. Kerins","year":"2005","unstructured":"Kerins, T., Marnane, W., Popovici, E., Barreto, P.: Efficient hardware for the Tate pairing calculation in characteristic three. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 412\u2013426. Springer, Heidelberg (2005)"},{"key":"23_CR14","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TIT.1977.1055735","volume":"23","author":"A. Lempel","year":"1977","unstructured":"Lempel, A., Winograd, S.: A new approach to error-correcting codes. IEEE Transactions on Information Theory IT-23, 503\u2013508 (1977)","journal-title":"IEEE Transactions on Information Theory IT-"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00289470","volume":"7","author":"A. Sch\u00f6nhage","year":"1977","unstructured":"Sch\u00f6nhage, A.: Schnelle multiplikation von polynomen \u00fcber k\u00f6rpen der Charakteristik 2. Acta Inf.\u00a07, 395\u2013398 (1977)","journal-title":"Acta Inf."},{"issue":"2","key":"23_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.4218\/etrij.09.0108.0317","volume":"31","author":"M. Shirase","year":"2009","unstructured":"Shirase, M., Takagi, T., Choi, D., Han, D.-H., Kim, H.: Efficient computation of Eta pairing over binary field with Vandermonde matrix. ETRI Journal\u00a031(2), 129\u2013139 (2009)","journal-title":"ETRI Journal"},{"key":"23_CR17","first-page":"714","volume":"3","author":"A. Toom","year":"1963","unstructured":"Toom, A.: The complexity of a scheme of functional elements realizing the multiplication of integers. Soviet Mathematics\u00a03, 714\u2013716 (1963)","journal-title":"Soviet Mathematics"},{"key":"23_CR18","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970364","volume-title":"Arithmetic complexity of computations","author":"S. Winograd","year":"1980","unstructured":"Winograd, S.: Arithmetic complexity of computations. SIAM, Philadelphia (1980)"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05445-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T11:29:35Z","timestamp":1580297375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05445-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642054433","9783642054457"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05445-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}