{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T09:58:52Z","timestamp":1742378332327},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119248"},{"type":"electronic","value":"9783642119255"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11925-5_7","type":"book-chapter","created":{"date-parts":[[2010,2,15]],"date-time":"2010-02-15T02:41:05Z","timestamp":1266201665000},"page":"89-105","source":"Crossref","is-referenced-by-count":20,"title":["High-Speed Parallel Software Implementation of the \u03b7 T Pairing"],"prefix":"10.1007","author":[{"given":"Diego F.","family":"Aranha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julio","family":"L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darrel","family":"Hankerson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"7_CR1","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., Gailbraith, S., \u00d3 h\u00c9igeartaigh, C., Scott, M.: Efficient Pairing Computation on Supersingular Abelian Varieties. Design, Codes and Cryptography\u00a042(3), 239\u2013271 (2007)","journal-title":"Design, Codes and Cryptography"},{"key":"7_CR2","unstructured":"Wechsler, O.: Inside Intel Core Microarchitecture: Setting new standards for energy-efficient performance. Technology@Intel Magazine (2006)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-04159-4_3","volume-title":"Selected Areas in Cryptography","author":"P. Grabher","year":"2009","unstructured":"Grabher, P., Groszschaedl, J., Page, D.: On Software Parallel Implementation of Cryptographic Pairings. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) Selected Areas in Cryptography. LNCS, vol.\u00a05381, pp. 34\u201349. Springer, Heidelberg (2009)"},{"key":"7_CR4","first-page":"188","volume-title":"Identity-Based Cryptography","author":"D. Hankerson","year":"2008","unstructured":"Hankerson, D., Menezes, A., Scott, M.: Identity-Based Cryptography, ch.\u00a012, pp. 188\u2013206. IOS Press, Amsterdam (2008)"},{"key":"7_CR5","unstructured":"Intel 64 and IA-32 Architectures Software Developer\u2019s Manual Volume 2: Instruction Set Reference, \n                    \n                      http:\/\/www.intel.com\/Assets\/PDF\/manual\/253666.pdf"},{"key":"7_CR6","unstructured":"Gueron, S., Kounavis, M.E.: Carry-Less Multiplication and Its Usage for Computing The GCM Mode. White paper, \n                    \n                      http:\/\/software.intel.com\/"},{"key":"7_CR7","volume-title":"Guide to Elliptic Curve Cryptography","author":"D. Hankerson","year":"2003","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Secaucus (2003)"},{"issue":"8","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1109\/TC.2004.43","volume":"53","author":"K. Fong","year":"2004","unstructured":"Fong, K., Hankerson, D., L\u00f3pez, J., Menezes, A.: Field inversion and point halving revisited. IEEE Transactions on Computers\u00a053(8), 1047\u20131059 (2004)","journal-title":"IEEE Transactions on Computers"},{"key":"7_CR9","first-page":"293","volume":"145","author":"A. Karatsuba","year":"1962","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of many-digital numbers by automatic computers (in Russian). Doklady Akad. Nauk SSSR\u00a0145, 293\u2013294 (1962)","journal-title":"Doklady Akad. Nauk SSSR"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-44495-5_18","volume-title":"Progress in Cryptology - INDOCRYPT 2000","author":"J. L\u00f3pez","year":"2000","unstructured":"L\u00f3pez, J., Dahab, R.: High-speed software multiplication in GF(2\n                    m\n                  ). In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol.\u00a01977, pp. 203\u2013212. Springer, Heidelberg (2000)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/978-3-642-10433-6_28","volume-title":"CANS 2009","author":"J. Beuchat","year":"2009","unstructured":"Beuchat, J., L\u00f3pez-Trejo, E., Mart\u00ednez-Ramos, L., Mitsunari, S., Rodr\u00edguez-Henr\u00edquez, F.: Multi-core implementation of the Tate pairing over supersingular elliptic curves. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol.\u00a05888, pp. 413\u2013432. Springer, Heidelberg (2009)"},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00145-004-0311-z","volume":"17","author":"P.S.L.M. Barreto","year":"2004","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Efficient Implementation of Pairing-Based Cryptosystems. Journal of Cryptology\u00a017(4), 321\u2013334 (2004)","journal-title":"Journal of Cryptology"},{"key":"7_CR13","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)"},{"issue":"4","key":"7_CR14","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"V.S. Miller","year":"2004","unstructured":"Miller, V.S.: The Weil Pairing, and Its Efficient Calculation. Journal of Cryptology\u00a017(4), 235\u2013261 (2004)","journal-title":"Journal of Cryptology"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"4595","DOI":"10.1109\/TIT.2006.881709","volume":"52","author":"F. Hess","year":"2006","unstructured":"Hess, F., Smart, N.P., Vercauteren, F.: The eta pairing revisited. IEEE Trans. on Information Theory\u00a052, 4595\u20134602 (2006)","journal-title":"IEEE Trans. on Information Theory"},{"issue":"4","key":"7_CR16","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1109\/TIT.2009.2013048","volume":"55","author":"H. Lee","year":"2009","unstructured":"Lee, H., Lee, E., Park, C.: Efficient and Generalized Pairing Computation on Abelian Varieties. IEEE Trans. on Information Theory\u00a055(4), 1793\u20131803 (2009)","journal-title":"IEEE Trans. on Information Theory"},{"key":"7_CR17","unstructured":"Mitsunari, S.: A Fast Implementation of \u03b7\n                  \n                    T\n                   Pairing in Characteristic Three on Intel Core 2 Duo Processor. Cryptology ePrint Archive, Report 2009\/032 (2009)"},{"key":"7_CR18","unstructured":"Cesena, E.: Pairing with Supersingular Trace Zero Varieties Revisited. Cryptology ePrint Archive, Report 2008\/404 (2008)"},{"key":"7_CR19","unstructured":"Cesena, E., Avanzi, R.: Trace Zero Varieties in Pairing-based Cryptography. In: Conference on Hyperelliptic curves, discrete Logarithms, Encryption, etc. (2009), \n                    \n                      http:\/\/inst-mat.utalca.cl\/chile2009\/Slides\/Roberto_Avanzi_2.pdf"},{"key":"7_CR20","unstructured":"Vercauteren, F.: Optimal pairings. Cryptology ePrint Archive, Report 2008\/096 (2008)"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-85538-5_20","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"J. Beuchat","year":"2008","unstructured":"Beuchat, J., Brisebarre, N., Detrey, J., Okamoto, E., Rodr\u00edguez-Henr\u00edquez, F.: A Comparison Between Hardware Accelerators for the Modified Tate Pairing over \n                    \n                      \n                    \n                    ${\\mathbb F}_{2^m}$\n                   and \n                    \n                      \n                    \n                    ${\\mathbb F}_{3^m}$\n                  . In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 297\u2013315. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology - CT-RSA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11925-5_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:45:27Z","timestamp":1606167927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11925-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119248","9783642119255"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11925-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}