{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:07:08Z","timestamp":1725491228380},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540743767"},{"type":"electronic","value":"9783540743774"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74377-4_42","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T05:38:34Z","timestamp":1189575514000},"page":"396-405","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Implementation of Tate Pairing on a Mobile Phone Using Java"],"prefix":"10.1007","author":[{"given":"Yuto","family":"Kawahara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eiji","family":"Okamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","unstructured":"Barreto, P. S. L. M.: A note on efficient computation of cube roots in characteristic 3, IACR ePrint Archive, Report 2004\/305 (2004)"},{"key":"42_CR2","unstructured":"Barreto, P. S. L. M., Galbraith, S., O\u2019hEigeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties, To appear in Designs, Codes, and Cryptography"},{"key":"42_CR3","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., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) Advances in Cryptology - CRYPTO 2002. LNCS, vol.\u00a02442, pp. 354\u2013368. Springer, Heidelberg (2002)"},{"key":"42_CR4","unstructured":"Bouncy Castle Crypto APIs, The Legion of the Bouncy Castle. http:\/\/www.bouncycastle.org\/"},{"key":"42_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 application. In: Joye, M. (ed.) Topics in Cryptology - CT-RSA 2003. LNCS, vol.\u00a02612, pp. 158\u2013175. Springer, Heidelberg (2003)"},{"issue":"3","key":"42_CR6","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity based encryption from the Weil pairing. SIAM J. Comput.\u00a032(3), 586\u2013615 (2001)","journal-title":"SIAM J. Comput."},{"key":"42_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.) Advances in Cryptology \u2013 CRYPTO 2005. LNCS, vol.\u00a03621, pp. 258\u2013275. Springer, Heidelberg (2005)"},{"key":"42_CR8","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.) Advances in Cryptology - ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001)"},{"key":"42_CR9","unstructured":"Certicom Research: EC 2: Recommended Elliptic Curve Domain Parameters, Version 1.0 (2000)"},{"key":"42_CR10","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.) Advances in Cryptology - ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 111\u2013123. Springer, Heidelberg (2003)"},{"key":"42_CR11","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":"42_CR12","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.: Software implementation of finite fields of characteristic three, for use in pairing-based cryptosystems. LMS J. Comput. Math.\u00a05, 181\u2013193 (2002)","journal-title":"LMS J. Comput. Math."},{"key":"42_CR13","unstructured":"IAIK Provider for the Java Cryptography Extension (IAIK-JCE). http:\/\/www.iaik.tugraz.at\/"},{"key":"42_CR14","unstructured":"Java 2 Platform, Micro Edition (J2ME). http:\/\/java.sun.com\/javame\/"},{"key":"42_CR15","unstructured":"Java Cryptography Extension (JCE). http:\/\/java.sun.com\/products\/jce\/"},{"key":"42_CR16","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.) Cryptographic Hardware and Embedded Systems \u2013 CHES 2005. LNCS, vol.\u00a03659, pp. 412\u2013426. Springer, Heidelberg (2005)"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Kwon. S.: Efficient Tate pairing computation for supersingular elliptic curves over binary fields, IACR ePrint Archive, Report, p. 303 (2004)","DOI":"10.1007\/11506157_12"},{"key":"42_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/11894063_11","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"M. Scott","year":"2006","unstructured":"Scott, M., Costigan, N., Abdulwahab, W.: Implementing Cryptographic Pairings on Smartcards. In: Goubin, L., Matsui, M. (eds.) Cryptographic Hardware and Embedded Systems - CHES 2006. LNCS, vol.\u00a04249, pp. 134\u2013147. Springer, Heidelberg (2006)"},{"key":"42_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1920-8","volume-title":"The arithmetic of elliptic curves","author":"J. Silverman","year":"1986","unstructured":"Silverman, J.: The arithmetic of elliptic curves. Springer, Heidelberg (1986)"},{"issue":"1","key":"42_CR20","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1093\/ietfec\/e89-a.1.115","volume":"E89-A","author":"T. Takagi","year":"2006","unstructured":"Takagi, T., Reis Jr., D., Yen, S.-M., Wu, B.-C.: Radix-r non-adjacent form and its application to pairing-based cryptosystem. IEICE Transactions\u00a0E89-A(1), 115\u2013123 (2006)","journal-title":"IEICE Transactions"},{"key":"42_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1007\/978-3-540-30182-0_94","volume-title":"Computer and Information Sciences - ISCIS 2004","author":"S. Tillich","year":"2004","unstructured":"Tillich, S., Gro\u00dfschadl, J.: A survey of public-key cryptography on J2ME-enabled mobile devices. In: Aykanat, C., Dayar, T., K\u00f6rpeo\u011flu, \u0130. (eds.) Computer and Information Sciences - ISCIS 2004. LNCS, vol.\u00a03280, pp. 935\u2013944. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Computational Intelligence and Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74377-4_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:21:35Z","timestamp":1619518895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74377-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540743767","9783540743774"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74377-4_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}