{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:20:54Z","timestamp":1758270054622},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775348"},{"type":"electronic","value":"9783540775355"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-77535-5_15","type":"book-chapter","created":{"date-parts":[[2008,1,8]],"date-time":"2008-01-08T15:23:47Z","timestamp":1199805827000},"page":"203-214","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Implementation of the Pairing on Mobilephones Using BREW"],"prefix":"10.1007","author":[{"given":"Motoi","family":"Yoshitomi","sequence":"first","affiliation":[]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[]},{"given":"Shinsaku","family":"Kiyomoto","sequence":"additional","affiliation":[]},{"given":"Toshiaki","family":"Tanaka","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"15_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, M.: Efficient Pairing Computation on Supersingular Abelian Varieties. Designs, Codes and Cryptography\u00a042(3), 239\u2013271 (2007)","journal-title":"Designs, Codes and Cryptography"},{"key":"15_CR2","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. Barreto","year":"2002","unstructured":"Barreto, P., Kim, H., 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)"},{"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: IEEE International Symposium on Computer Arithmetic, ARITH-18, pp. 97\u2013104 (2007)","key":"15_CR3","DOI":"10.1109\/ARITH.2007.10"},{"issue":"3","key":"15_CR4","first-page":"514","volume":"32","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity Based Encryption from the Weil Pairing. SIAM J. Comput.\u00a032(3), 514\u2013532 (2001)","journal-title":"SIAM J. Comput."},{"key":"15_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 - 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":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"15_CR7","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.) Algorithmic Number Theory. LNCS, vol.\u00a02369, pp. 324\u2013337. Springer, Heidelberg (2002)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1112\/S1461157000001194","volume":"9","author":"R. Granger","year":"2006","unstructured":"Granger, R., Page, D., Stam, M.: On Small Characteristic Algebraic Tori in Pairing-Based Cryptography. LMS Journal of Computation and Mathematics\u00a09, 64\u201385 (2006)","journal-title":"LMS Journal of Computation and Mathematics"},{"issue":"7","key":"15_CR9","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":"15_CR10","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)"},{"doi-asserted-by":"crossref","unstructured":"Kawahara, Y., Takagi, T., Okamoto, E.: Efficient Implementation of Tate Pairing on a Mobile Phone using Java. In: CIS 2006. LNCS (LNAI), vol.\u00a04456, pp. 396\u2013405 (2007)","key":"15_CR11","DOI":"10.1007\/978-3-540-74377-4_42"},{"key":"15_CR12","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)"},{"doi-asserted-by":"crossref","unstructured":"Kwon, S.: Efficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields. Cryptology ePrint Archive, Report 2004\/303 (2004)","key":"15_CR13","DOI":"10.1007\/11506157_12"},{"unstructured":"Miller, V.: Short Programs for Functions on Curves (unpublished Manuscript)","key":"15_CR14"},{"doi-asserted-by":"crossref","unstructured":"Shirase, M., Takagi, T., Okamoto, E.: Some efficient algorithms for the final exponentiation of \u03b7 T pairing. In: ISPEC 2007. LNCS, vol.\u00a04464, pp. 254\u2013268 (2007)","key":"15_CR15","DOI":"10.1007\/978-3-540-72163-5_20"}],"container-title":["Lecture Notes in Computer Science","Information Security Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77535-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T18:39:57Z","timestamp":1684175997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77535-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540775348","9783540775355"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77535-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}