{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:18:41Z","timestamp":1765545521933},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540855033"},{"type":"electronic","value":"9783540855385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85538-5_19","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T00:12:35Z","timestamp":1219623155000},"page":"282-296","source":"Crossref","is-referenced-by-count":14,"title":["Faster Implementation of \u03b7 T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition"],"prefix":"10.1007","author":[{"given":"Yuto","family":"Kawahara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazumaro","family":"Aoki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-73074-3_8","volume-title":"Arithmetic of Finite Fields","author":"O. Ahmadi","year":"2007","unstructured":"Ahmadi, O., Hankerson, D., Menezes, A.: Software implementation of arithmetic in $\\mathbb{F}_{3^{m}}$ . In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol.\u00a04547, pp. 85\u2013102. Springer, Heidelberg (2007)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Barker, E., Barker, W., Burr, W., Polk, W., Smid, M.: Recommendation for Key Management \u2013 Part 1: General (Revised). NIST Special Publication 800\u201357 (2007)","DOI":"10.6028\/NIST.SP.800-57p1r2007"},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"P.S.L.M. Barreto","year":"2007","unstructured":"Barreto, P.S.L.M., Galbraith, S., \u00d3\u2019h\u00c9igeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Designs, Codes and Cryptography\u00a042(3), 239\u2013271 (2007)","journal-title":"Designs, Codes and Cryptography"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"P.S.L.M. Barreto","year":"2002","unstructured":"Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 354\u2013368. Springer, Heidelberg (2002)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/3-540-36563-X_11","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"G. Bertoni","year":"2003","unstructured":"Bertoni, G., Guajardo, J., Kumar, S., Orland, G., Paar, C., Wollinger, T.: Efficient GF(p m ) arithmetic architectures for cryptographic applications. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 158\u2013175. Springer, Heidelberg (2003)"},{"key":"19_CR6","unstructured":"Beuchat, J., Brisebarre, N., Detrey, J., Okamoto, E., Shirase, M., Takagi, T.: Algorithms and arithmetic operators for computing the \u03b7. pairing in characteristic three. Cryptology ePrint Archive, Report 2007\/417 (2007)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Beuchat, J., Shirase, M., Takagi, T., Okamoto, E.: An algorithm for the \u03b7 T pairing calculation in characteristic three and its hardware implementation. In: 18th IEEE International Symposium on Computer Arithmetic ARITH-18, pp. 97\u2013104 (2007)","DOI":"10.1109\/ARITH.2007.10"},{"key":"19_CR8","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., Crescenzo, D., 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":"19_CR9","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 on Computing\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR10","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":"19_CR11","unstructured":"Compaq Computer Corporation: Alpha Architecture Handbook (Version 4) (1998)"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-540-40061-5_7","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"I. Duursma","year":"2003","unstructured":"Duursma, I., Lee, H.: Tate pairing implementation for hyperelliptic curves y 2\u2009=\u2009x p \u2009\u2212\u2009x\u2009+\u2009d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 111\u2013123. Springer, Heidelberg (2003)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-45455-1_26","volume-title":"Algorithmic Number Theory","author":"S. Galbraith","year":"2002","unstructured":"Galbraith, S., Harrison, K., Soldera, D.: Implementing the Tate pairing. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol.\u00a02369, pp. 324\u2013337. Springer, Heidelberg (2002)"},{"key":"19_CR14","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 $\\mathbb{F}_{3^{6m}}$ . In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol.\u00a04876, pp. 173\u2013183. Springer, Heidelberg (2007)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/11792086_34","volume-title":"Algorithmic Number Theory","author":"R. Granger","year":"2006","unstructured":"Granger, R., Page, D., Smart, N.P.: High security pairing-based cryptography revisited. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 480\u2013494. Springer, Heidelberg (2006)"},{"issue":"7","key":"19_CR16","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1109\/TC.2005.120","volume":"54","author":"R. Granger","year":"2005","unstructured":"Granger, R., Page, D., Stam, M.: Hardware and software normal basis arithmetic for pairing-based cryptography in characteristic three. IEEE Transactions on Computers\u00a054(7), 852\u2013860 (2005)","journal-title":"IEEE Transactions on Computers"},{"key":"19_CR17","unstructured":"Hankerson, D., Menezes, A., Scott, M.: Software implementation of pairings. Centre for Applied Cryptographic Research (CACR) Technical Reports, CACR 2008-08 (2008), http:\/\/www.cacr.math.uwaterloo.ca\/techreports\/2008\/cacr2008-08.pdf"},{"key":"19_CR18","volume-title":"Guide to Elliptic Curve Cryptography","author":"D. Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)"},{"key":"19_CR19","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1112\/S1461157000000747","volume":"5","author":"K. Harrison","year":"2002","unstructured":"Harrison, K., Page, D., Smart, N.P.: Software implementation of finite fields of characteristic three, for use in pairing-based cryptosystems. LMS Journal of Computation and Mathematics\u00a05, 181\u2013193 (2002)","journal-title":"LMS Journal of Computation and Mathematics"},{"key":"19_CR20","unstructured":"Intel Corporation: Intel Architecture Software Developer\u2019s Manual, vol. 2, Instruction Set Reference (1999)"},{"key":"19_CR21","unstructured":"SPARC International, Inc.: The SPARC Architecture Manual, Version 9 (2000)"},{"key":"19_CR22","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.S.L.M.: 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":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11586821_2","volume-title":"Cryptography and Coding","author":"N. Koblitz","year":"2005","unstructured":"Koblitz, N., Menezes, A.: Pairing-based cryptography at high security levels. In: Smart, N. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 13\u201336. Springer, Heidelberg (2005)"},{"key":"19_CR24","unstructured":"Miller, V.S.: Short program for functions on curves (unpublished manuscript, 1986)"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/3-540-36400-5_38","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"D. Page","year":"2003","unstructured":"Page, D., Smart, N.P.: Hardware implementation of finite fields of characteristic three. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 529\u2013539. Springer, Heidelberg (2003)"},{"issue":"5","key":"19_CR26","first-page":"379","volume":"17","author":"D. Page","year":"2006","unstructured":"Page, D., Smart, N., Vercauteren, F.: A comparison of MNT curves and supersingular curves. Applicable Algebra in Engineering. Communication and Computing\u00a017(5), 379\u2013392 (2006)","journal-title":"Communication and Computing"},{"key":"19_CR27","unstructured":"Sakai, R., Kasahara, M.: ID based cryptosystems with pairing on elliptic curve. Cryptology ePrint Archive, Report 2003\/054 (2003)"},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-77535-5_1","volume-title":"Information Security Applications","author":"M. Shirase","year":"2008","unstructured":"Shirase, M., Kawahara, Y., Takagi, T., Okamoto, E.: Universal \u03b7 T pairing algorithm over arbitrary extension degree. In: Kim, S., Yung, M., Lee, H.-W. (eds.) WISA 2007. LNCS, vol.\u00a04867, pp. 1\u201315. Springer, Heidelberg (2008)"},{"key":"19_CR29","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 \u03b7 T pairing. In: Dawson, E., Wong, D.S. (eds.) ISPEC 2007. LNCS, vol.\u00a04464, pp. 254\u2013268. Springer, Heidelberg (2007)"},{"key":"19_CR30","unstructured":"Takahashi, G., Hoshino, F., Kobayashi, T.: Efficient GF(3 m ) multiplication algorithm for \u03b7T pairing. Cryptology ePrint Archive, Report 2007\/463 (2007)"}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography \u2013 Pairing 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85538-5_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:32:05Z","timestamp":1606167125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85538-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540855033","9783540855385"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85538-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}