{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:39:17Z","timestamp":1725500357832},"publisher-location":"Berlin, Heidelberg","reference-count":16,"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_1","type":"book-chapter","created":{"date-parts":[[2008,1,8]],"date-time":"2008-01-08T15:23:47Z","timestamp":1199805827000},"page":"1-15","source":"Crossref","is-referenced-by-count":2,"title":["Universal \u03b7 T Pairing Algorithm over Arbitrary Extension Degree"],"prefix":"10.1007","author":[{"given":"Masaaki","family":"Shirase","sequence":"first","affiliation":[]},{"given":"Yuto","family":"Kawahara","sequence":"additional","affiliation":[]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[]},{"given":"Eiji","family":"Okamoto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Barreto, P.: A note on efficient computation of cube roots in characteristic 3, Cryptology ePrint Archive, Report 2004\/305 (2004)"},{"key":"1_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":"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)"},{"key":"1_CR3","first-page":"239","volume-title":"Designs, Codes and Cryptography","author":"P. Barreto","year":"2007","unstructured":"Barreto, P., Galbraith, S., \u00d3 h\u00c9igeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties. In: Designs, Codes and Cryptography, vol.\u00a042(3), pp. 239\u2013271. Springer, Heidelberg (2007)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Beuchat, J.-L., 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) full version, Cryptology ePrint Archive, Report 2006\/327 (2006)","DOI":"10.1109\/ARITH.2007.10"},{"issue":"3","key":"1_CR5","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":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11535218_16","volume-title":"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)"},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signature from the Weil pairing. Journal of Cryptology\u00a017(4), 297\u2013319 (2004)","journal-title":"Journal of Cryptology"},{"key":"1_CR8","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":"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)"},{"issue":"7","key":"1_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":"1_CR10","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":"1_CR11","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)","DOI":"10.1007\/11506157_12"},{"key":"1_CR12","unstructured":"Miller, V.: Short programs for functions on curves, Unpublished manuscript (1986), http:\/\/crypto.stanford.edu\/miller\/miller.pdf"},{"key":"1_CR13","unstructured":"MIRACL, ftp:\/\/ftp.computing.dcu.ie\/pub\/crypto\/miracl.zip"},{"key":"1_CR14","first-page":"11","volume-title":"Information Technology : New Generations, ITNG 2007","author":"R. Ronan","year":"2007","unstructured":"Ronan, R., h\u00c9igeartaigh, C.\u00d3., Murphy, C., Kerins, T., Barreto, P.: A reconfigurable processor for the cryptographic \u03b7 T pairing in characteristic 3. In: Information Technology: New Generations, ITNG 2007, pp. 11\u201316. IEEE Computer Society, Los Alamitos (2007)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/978-3-540-72163-5_20","volume-title":"ISPEC 2007","author":"M. Shirase","year":"2007","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. Springer, Heidelberg (2007)"},{"key":"1_CR16","doi-asserted-by":"publisher","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)"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T18:39:55Z","timestamp":1684175995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77535-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540775348","9783540775355"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77535-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}