{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:15:52Z","timestamp":1743135352238,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662447901"},{"type":"electronic","value":"9783662447918"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44791-8_9","type":"book-chapter","created":{"date-parts":[[2014,9,11]],"date-time":"2014-09-11T13:40:31Z","timestamp":1410442831000},"page":"137-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Use of SIMD Features to Speed up Eta Pairing"],"prefix":"10.1007","author":[{"given":"Anup Kumar","family":"Bhattacharya","sequence":"first","affiliation":[]},{"given":"Sabyasachi","family":"Karati","sequence":"additional","affiliation":[]},{"given":"Abhijit","family":"Das","sequence":"additional","affiliation":[]},{"given":"Dipanwita","family":"Roychowdhury","sequence":"additional","affiliation":[]},{"given":"Bhargav","family":"Bellur","sequence":"additional","affiliation":[]},{"given":"Aravind","family":"Iyer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,12]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Adj, G., Menezes, A., Oliveira, T., Rodr\u00edguez-Henr\u00edquez, F.: Weakness of $$\\mathbb{F}_{3^{6 \\cdot 1429}}$$ and $$\\mathbb{F}_{2^{4 \\cdot 3041}}$$ for discrete logarithm cryptography. In: IACR Eprint Archive (2013). http:\/\/eprint.iacr.org\/2013\/737","DOI":"10.1007\/978-3-319-04873-4_2"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Adj, G., Menezes, A., Oliveira, T., Rodr\u00edguez-Henr\u00edquez, F.: Weakness of $$\\mathbb{F}_{3^{6\\cdot 509}}$$ for discrete logarithm cryptography. In: IACR Eprint Archive (2013). http:\/\/eprint.iacr.org\/2013\/446","DOI":"10.1007\/978-3-319-04873-4_2"},{"key":"9_CR3","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. 4547, pp. 85\u2013102. Springer, Heidelberg (2007)"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1109\/TC.2009.183","volume":"59","author":"O Ahmadi","year":"2010","unstructured":"Ahmadi, O., Rodriguez-Henriquez, F.: Low complexity cubing and cube root computation over $${\\mathbb{F}}_{3^m}$$ in polynomial basis. IEEE Trans. Comput. 59, 1297\u20131308 (2010)","journal-title":"IEEE Trans. Comput."},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-11925-5_7","volume-title":"Topics in Cryptology - CT-RSA 2010","author":"DF Aranha","year":"2010","unstructured":"Aranha, D.F., L\u00f3pez, J., Hankerson, D.: High-speed parallel software implementation of the $$\\eta _T$$ pairing. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol. 5985, pp. 89\u2013105. Springer, Heidelberg (2010)"},{"key":"9_CR6","unstructured":"Barbulescu, R., Gaudry, P., Joux, A., Thom\u00e9, E.: A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. In: IACR Eprint Archive (2013). http:\/\/eprint.iacr.org\/2013\/400"},{"key":"9_CR7","unstructured":"Barreto, P.S.L.M.: A note on efficient computation of cube roots in characteristic $$3$$. In: IACR Eprint Archive (2004). http:\/\/eprint.iacr.org\/2004\/305"},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"PSLM Barreto","year":"2007","unstructured":"Barreto, P.S.L.M., Galbraith, S.D., O\u00c9igeartaigh, C., Scott, M.: Efficient pairing computation on supersingular Abelian varieties. Des. Codes Crypt. 42(3), 239\u2013271 (2007)","journal-title":"Des. Codes Crypt."},{"key":"9_CR9","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":"PSLM 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. 2442, pp. 354\u2013368. Springer, Heidelberg (2002)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-10433-6_28","volume-title":"Cryptology and Network Security","author":"J-L Beuchat","year":"2009","unstructured":"Beuchat, J.-L., 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. 5888, pp. 413\u2013432. Springer, Heidelberg (2009)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"key":"9_CR12","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 signatures from the Weil pairing. J. Cryptology 17, 297\u2013319 (2004)","journal-title":"J. Cryptology"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-38553-7_2","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2013","author":"U Bose","year":"2013","unstructured":"Bose, U., Bhattacharya, A.K., Das, A.: GPU-based implementation of 128-bit secure eta pairing over a binary field. In: Youssef, A., Nitaj, A., Hassanien, A.E. (eds.) AFRICACRYPT 2013. LNCS, vol. 7918, pp. 26\u201342. Springer, Heidelberg (2013)"},{"key":"9_CR14","unstructured":"Drepper, U.: What every programmer should know about memory (2007). http:\/\/lwn.net\/Articles\/250967\/"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D Freeman","year":"2010","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. J. Cryptology 23, 224\u2013280 (2010)","journal-title":"J. Cryptology"},{"key":"9_CR16","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. 4876, pp. 173\u2013183. Springer, Heidelberg (2007)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-04159-4_3","volume-title":"Selected Areas in Cryptography","author":"P Grabher","year":"2009","unstructured":"Grabher, P., Gro\u00dfsch\u00e4dl, J., Page, D.: On software parallel implementation of cryptographic pairings. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol. 5381, pp. 35\u201350. Springer, Heidelberg (2009)"},{"issue":"7","key":"9_CR18","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 Trans. Comput. 54(7), 852\u2013860 (2005)","journal-title":"IEEE Trans. Comput."},{"key":"9_CR19","series-title":"Identity Based Cryptography","first-page":"188","volume-title":"Software Implementation of Pairings","author":"D Hankerson","year":"2008","unstructured":"Hankerson, D., Menezes, A., Scott, M.: Software Implementation of Pairings. Identity Based Cryptography, pp. 188\u2013206. IOS Press, Amsterdam (2008)"},{"issue":"10","key":"9_CR20","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. Inf. Theor. 52(10), 4595\u20134602 (2006)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"9_CR21","unstructured":"Intel: Intel$$^{\\textregistered }$$ C++ compiler XE 13.1 user and reference guide: compiler reference: intrinsics (2013). http:\/\/software.intel.com\/sites\/products\/documentation\/doclib\/iss\/2013\/compiler\/cpp-lin\/GUID-712779D8-D085-4464-9662-B630681F16F1.htm"},{"key":"9_CR22","unstructured":"Intel: Intel Instruction Set Architecture Extensions (2014). http:\/\/software.intel.com\/en-us\/intel-isa-extensions"},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00145-004-0312-y","volume":"17","author":"A Joux","year":"2004","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. J. Cryptology 17, 263\u2013276 (2004)","journal-title":"J. Cryptology"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-38348-9_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"A Joux","year":"2013","unstructured":"Joux, A.: Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 177\u2013193. Springer, Heidelberg (2013)"},{"key":"9_CR25","unstructured":"Katoh, Y., Huang, Y. J., Cheng, C. M., Takagi, T.: Efficient implementation of the $$\\eta _T$$ pairing on GPU. In: IACR Eprint Archive (2011). http:\/\/eprint.iacr.org\/2011\/540"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-85538-5_19","volume-title":"Pairing-Based Cryptography - Pairing 2008","author":"Y Kawahara","year":"2008","unstructured":"Kawahara, Y., Aoki, K., Takagi, T.: Faster implementation of $$\\eta _{T}$$ pairing over GF$$(3^{m})$$ using minimum number of logical instructions for GF(3)-addition. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 282\u2013296. Springer, Heidelberg (2008)"},{"key":"9_CR27","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.P., Popovici, E.M., 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. 3659, pp. 412\u2013426. Springer, Heidelberg (2005)"},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1109\/TIT.2009.2013048","volume":"55","author":"E Lee","year":"2009","unstructured":"Lee, E., Lee, H.S., Park, C.M.: Efficient and generalized pairing computation on Abelian varieties. IEEE Trans. Inf. Theor. 55, 1793\u20131803 (2009)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 F2m. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol. 1977, pp. 203\u2013212. Springer, Heidelberg (2000)"},{"key":"9_CR30","unstructured":"Microsoft: MMX, SSE, and SSE2 Intrinsics (2010). http:\/\/msdn.microsoft.com\/en-us\/library\/y0dh78ez(v=vs.90).aspx"},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"V Miller","year":"2004","unstructured":"Miller, V.: The Weil pairing and its efficient calculation. J. Cryptology 17, 235\u2013261 (2004)","journal-title":"J. Cryptology"},{"key":"9_CR32","unstructured":"Montgomery, P.L.: Vectorization of the elliptic curve method. ACM (1991)"},{"key":"9_CR33","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1109\/TC.2004.100","volume":"53","author":"D Page","year":"2004","unstructured":"Page, D., Smart, N.P.: Parallel cryptographic arithmetic using a redundant Montgomery representation. IEEE Trans. Comput. 53, 1474\u20131482 (2004)","journal-title":"IEEE Trans. Comput."},{"key":"9_CR34","unstructured":"Scott, M.: Optimal irreducible polynomials for $${\\rm GF}(2^m)$$ arithmetic. In: IACR Eprint Archive (2007). http:\/\/eprint.iacr.org\/2007\/192"},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-03298-1_6","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"M Scott","year":"2009","unstructured":"Scott, M., Benger, N., Charlemagne, M., Dominguez Perez, L.J., Kachisa, E.J.: On the final exponentiation for calculating pairings on ordinary elliptic curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol. 5671, pp. 78\u201388. Springer, Heidelberg (2009)"},{"key":"9_CR36","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1112\/S1461157000000747","volume":"5","author":"NP Smart","year":"2002","unstructured":"Smart, N.P., Harrison, K., Page, D.: Software implementation of finite fields of characteristic three. LMS J. Comput. Math. 5, 181\u2013193 (2002)","journal-title":"LMS J. Comput. Math."},{"key":"9_CR37","unstructured":"Takahashi, G., Hoshino, F., Kobayashi, T.: Efficient $${\\rm GF}(3^m)$$ multiplication algorithm for $$\\eta _{T}$$ pairing. In: IACR Eprint Archive (2007). http:\/\/eprint.iacr.org\/2007\/463"},{"key":"9_CR38","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F Vercauteren","year":"2010","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Trans. Inf. Theor. 56, 455\u2013461 (2010)","journal-title":"IEEE Trans. Inf. Theor."}],"container-title":["Communications in Computer and Information Science","E-Business and Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44791-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T11:44:00Z","timestamp":1720784640000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44791-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662447901","9783662447918"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44791-8_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"12 September 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}